java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/nla-digbench/divbin.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 13:16:31,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 13:16:31,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 13:16:31,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 13:16:31,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 13:16:31,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 13:16:31,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 13:16:31,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 13:16:31,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 13:16:31,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 13:16:31,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 13:16:31,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 13:16:31,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 13:16:31,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 13:16:31,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 13:16:31,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 13:16:31,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 13:16:31,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 13:16:31,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 13:16:31,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 13:16:31,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 13:16:31,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 13:16:31,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 13:16:31,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 13:16:31,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 13:16:31,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 13:16:31,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 13:16:31,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 13:16:31,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 13:16:31,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 13:16:31,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 13:16:31,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 13:16:31,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 13:16:31,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 13:16:31,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 13:16:31,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 13:16:31,120 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 13:16:31,120 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 13:16:31,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 13:16:31,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 13:16:31,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 13:16:31,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-05 13:16:31,137 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 13:16:31,137 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 13:16:31,137 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-05 13:16:31,138 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-05 13:16:31,138 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-05 13:16:31,139 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-05 13:16:31,139 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-05 13:16:31,139 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-05 13:16:31,139 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-05 13:16:31,139 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-05 13:16:31,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 13:16:31,140 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 13:16:31,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 13:16:31,141 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 13:16:31,141 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 13:16:31,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 13:16:31,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 13:16:31,141 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 13:16:31,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 13:16:31,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 13:16:31,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 13:16:31,142 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-05 13:16:31,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 13:16:31,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:16:31,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 13:16:31,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 13:16:31,143 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-05 13:16:31,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 13:16:31,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 13:16:31,144 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-05 13:16:31,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 13:16:31,183 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 13:16:31,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 13:16:31,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 13:16:31,188 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 13:16:31,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin.c [2019-09-05 13:16:31,251 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f655c8ed/74327a3f9dd94279bf96e87391b4697c/FLAGa4f24c285 [2019-09-05 13:16:31,679 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 13:16:31,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin.c [2019-09-05 13:16:31,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f655c8ed/74327a3f9dd94279bf96e87391b4697c/FLAGa4f24c285 [2019-09-05 13:16:32,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f655c8ed/74327a3f9dd94279bf96e87391b4697c [2019-09-05 13:16:32,084 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 13:16:32,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 13:16:32,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 13:16:32,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 13:16:32,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 13:16:32,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70464d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32, skipping insertion in model container [2019-09-05 13:16:32,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,101 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 13:16:32,117 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 13:16:32,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:16:32,280 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 13:16:32,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 13:16:32,309 INFO L192 MainTranslator]: Completed translation [2019-09-05 13:16:32,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32 WrapperNode [2019-09-05 13:16:32,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 13:16:32,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 13:16:32,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 13:16:32,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 13:16:32,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... [2019-09-05 13:16:32,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 13:16:32,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 13:16:32,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 13:16:32,427 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 13:16:32,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 13:16:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 13:16:32,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 13:16:32,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 13:16:32,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 13:16:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 13:16:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-05 13:16:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-05 13:16:32,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 13:16:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 13:16:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 13:16:32,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 13:16:32,673 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 13:16:32,673 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-05 13:16:32,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:16:32 BoogieIcfgContainer [2019-09-05 13:16:32,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 13:16:32,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 13:16:32,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 13:16:32,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 13:16:32,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 01:16:32" (1/3) ... [2019-09-05 13:16:32,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac39ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:16:32, skipping insertion in model container [2019-09-05 13:16:32,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 01:16:32" (2/3) ... [2019-09-05 13:16:32,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac39ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 01:16:32, skipping insertion in model container [2019-09-05 13:16:32,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 01:16:32" (3/3) ... [2019-09-05 13:16:32,704 INFO L109 eAbstractionObserver]: Analyzing ICFG divbin.c [2019-09-05 13:16:32,721 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 13:16:32,729 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 13:16:32,748 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 13:16:32,780 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 13:16:32,783 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-05 13:16:32,783 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 13:16:32,784 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 13:16:32,784 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 13:16:32,784 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 13:16:32,784 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 13:16:32,784 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 13:16:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-05 13:16:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-05 13:16:32,819 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:32,820 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:32,822 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:32,826 INFO L82 PathProgramCache]: Analyzing trace with hash -783376379, now seen corresponding path program 1 times [2019-09-05 13:16:32,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:32,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:32,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:32,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:32,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:32,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:16:32,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:16:32,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 13:16:32,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:16:32,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 13:16:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 13:16:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:16:32,946 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-05 13:16:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:32,961 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-09-05 13:16:32,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 13:16:32,963 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-05 13:16:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:32,972 INFO L225 Difference]: With dead ends: 23 [2019-09-05 13:16:32,972 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 13:16:32,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 13:16:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 13:16:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 13:16:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 13:16:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-09-05 13:16:33,013 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2019-09-05 13:16:33,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:33,014 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-09-05 13:16:33,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 13:16:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-09-05 13:16:33,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 13:16:33,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:33,015 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:33,015 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:33,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:33,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1238212304, now seen corresponding path program 1 times [2019-09-05 13:16:33,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:33,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:33,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:33,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:33,042 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:16:33,043 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:16:33,043 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) [2019-09-05 13:16:33,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:16:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,093 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-05 13:16:33,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:33,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:33,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:16:33,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:16:33,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:16:33,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:16:33,326 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:16:33,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-05 13:16:33,327 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:16:33,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 13:16:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 13:16:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 13:16:33,329 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-09-05 13:16:33,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:33,426 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-09-05 13:16:33,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:16:33,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 13:16:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:33,427 INFO L225 Difference]: With dead ends: 27 [2019-09-05 13:16:33,428 INFO L226 Difference]: Without dead ends: 26 [2019-09-05 13:16:33,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:16:33,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-05 13:16:33,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-05 13:16:33,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 13:16:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-05 13:16:33,441 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2019-09-05 13:16:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:33,443 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-05 13:16:33,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 13:16:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-05 13:16:33,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 13:16:33,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:33,445 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:33,445 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1076826781, now seen corresponding path program 1 times [2019-09-05 13:16:33,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:33,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:33,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:33,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:33,466 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:16:33,467 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:16:33,471 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) [2019-09-05 13:16:33,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:16:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,509 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-05 13:16:33,511 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [29], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64] [2019-09-05 13:16:33,551 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:16:33,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:16:33,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:16:33,670 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 20 root evaluator evaluations with a maximum evaluation depth of 8. Performed 20 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 7 variables. [2019-09-05 13:16:33,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:33,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:16:33,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:33,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:33,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:16:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-05 13:16:33,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:33,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:16:33,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 13:16:33,737 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-05 13:16:33,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-05 13:16:33,737 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-05 13:16:33,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 13:16:33,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 13:16:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:16:33,739 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-05 13:16:33,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:33,756 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-05 13:16:33,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 13:16:33,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-05 13:16:33,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:33,758 INFO L225 Difference]: With dead ends: 31 [2019-09-05 13:16:33,758 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 13:16:33,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 13:16:33,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 13:16:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-05 13:16:33,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-05 13:16:33,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-05 13:16:33,764 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-09-05 13:16:33,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:33,764 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-05 13:16:33,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 13:16:33,765 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-05 13:16:33,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 13:16:33,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:33,766 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:33,766 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1643387496, now seen corresponding path program 1 times [2019-09-05 13:16:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:33,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:33,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:33,782 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:16:33,782 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:16:33,782 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) [2019-09-05 13:16:33,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:16:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-05 13:16:33,814 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [29], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64] [2019-09-05 13:16:33,816 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:16:33,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:16:33,864 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:16:33,865 INFO L272 AbstractInterpreter]: Visited 16 different actions 39 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 63 root evaluator evaluations with a maximum evaluation depth of 8. Performed 63 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 2 different actions. Largest state had 7 variables. [2019-09-05 13:16:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:33,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:16:33,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:33,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:33,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:16:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:33,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:16:33,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-05 13:16:33,951 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 13:16:34,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:16:34,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-05 13:16:34,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:34,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:16:34,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:16:34,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:16:34,033 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 9 states. [2019-09-05 13:16:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:34,143 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-09-05 13:16:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:16:34,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-05 13:16:34,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:34,145 INFO L225 Difference]: With dead ends: 36 [2019-09-05 13:16:34,145 INFO L226 Difference]: Without dead ends: 35 [2019-09-05 13:16:34,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-05 13:16:34,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-05 13:16:34,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-05 13:16:34,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 13:16:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 13:16:34,151 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-09-05 13:16:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:34,152 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 13:16:34,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:16:34,153 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 13:16:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 13:16:34,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:34,154 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:34,154 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1005474043, now seen corresponding path program 2 times [2019-09-05 13:16:34,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:34,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:34,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:16:34,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:34,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:34,170 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:16:34,170 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:16:34,171 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:16:34,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:34,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:16:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:34,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:34,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:34,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:34,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:16:34,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:16:34,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:34,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-05 13:16:34,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:34,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 13:16:34,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:16:34,305 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-05 13:16:34,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:16:34,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-05 13:16:34,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:34,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 13:16:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 13:16:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:16:34,369 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-05 13:16:34,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:16:34,417 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-05 13:16:34,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:16:34,417 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-05 13:16:34,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:16:34,419 INFO L225 Difference]: With dead ends: 47 [2019-09-05 13:16:34,419 INFO L226 Difference]: Without dead ends: 37 [2019-09-05 13:16:34,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 13:16:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-05 13:16:34,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-05 13:16:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 13:16:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 13:16:34,426 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 30 [2019-09-05 13:16:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:16:34,426 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 13:16:34,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 13:16:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 13:16:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 13:16:34,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:16:34,428 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:16:34,428 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:16:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:16:34,429 INFO L82 PathProgramCache]: Analyzing trace with hash 365642816, now seen corresponding path program 3 times [2019-09-05 13:16:34,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:16:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:34,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:34,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:16:34,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:16:34,438 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:16:34,439 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:16:34,439 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:16:34,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:16:34,458 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:16:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:16:34,477 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:16:34,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:16:34,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:16:34,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:16:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:16:34,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:16:34,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:16:34,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:16:34,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 13:16:34,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:16:34,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:34,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:35,219 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-05 13:16:35,255 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~b~0_32 Int)) (let ((.cse1 (+ c_main_~b~0 c_main_~r~0)) (.cse0 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (<= .cse0 .cse1) (= (+ .cse1 (* (div (+ (* (- 1) c_main_~q~0) 1) (- 2)) v_main_~b~0_32)) c_main_~A~0) (= (div v_main_~b~0_32 2) c_main_~b~0) (< .cse1 v_main_~b~0_32) (= (mod .cse0 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))) (= (mod (+ c_main_~q~0 1) (- 2)) 0)) is different from false [2019-09-05 13:16:35,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:35,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:35,403 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (+ (div (- c_main_~q~0) (- 2)) 1) (- 2)) 0)) (.cse1 (= (mod c_main_~q~0 (- 2)) 0))) (or (and .cse0 .cse1 (exists ((v_main_~b~0_32 Int)) (let ((.cse3 (div v_main_~b~0_32 2))) (let ((.cse2 (+ .cse3 c_main_~r~0)) (.cse4 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (< .cse2 v_main_~b~0_32) (= c_main_~b~0 (div .cse3 2)) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse2) c_main_~A~0) (<= .cse4 .cse2) (= (mod .cse3 2) 0) (= (mod .cse4 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))))) (and .cse0 (exists ((v_main_~b~0_32 Int)) (let ((.cse6 (div v_main_~b~0_32 2))) (let ((.cse5 (+ .cse6 c_main_~r~0)) (.cse7 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (< .cse5 v_main_~b~0_32) (= c_main_~b~0 (div .cse6 2)) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse5) c_main_~A~0) (<= .cse7 .cse5) (= (mod .cse7 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2))) (<= 0 .cse6))))) .cse1) (and .cse0 (exists ((v_main_~b~0_32 Int)) (let ((.cse8 (div v_main_~b~0_32 2))) (let ((.cse9 (+ .cse8 c_main_~r~0)) (.cse10 (div (- v_main_~b~0_32) (- 2)))) (and (not (= (mod .cse8 2) 0)) (<= 0 v_main_~b~0_32) (< .cse9 v_main_~b~0_32) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse9) c_main_~A~0) (<= .cse10 .cse9) (< .cse8 0) (= (mod .cse10 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2))) (= c_main_~b~0 (+ (div .cse8 2) 1)))))) .cse1))) is different from false [2019-09-05 13:16:48,286 WARN L188 SmtUtils]: Spent 12.82 s on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2019-09-05 13:16:48,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2019-09-05 13:16:48,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:16:51,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:53,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:53,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:53,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:53,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:53,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:54,447 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-05 13:16:54,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-05 13:16:54,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:54,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:54,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:54,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:54,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:16:55,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 13:16:55,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:16:55,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-09-05 13:16:55,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:16:55,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 13:16:55,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 13:16:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=342, Unknown=9, NotChecked=78, Total=506 [2019-09-05 13:16:55,159 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 23 states. [2019-09-05 13:16:56,833 WARN L188 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-09-05 13:16:57,453 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (mod c_main_~b~0 2) 0)) (.cse1 (* 2 c_main_~q~0)) (.cse8 (div c_main_~b~0 2))) (let ((.cse0 (+ .cse8 1)) (.cse7 (+ .cse1 2)) (.cse6 (+ c_main_~r~0 (* (- 1) c_main_~b~0))) (.cse2 (<= 0 c_main_~b~0)) (.cse9 (and (not .cse3) (< c_main_~b~0 0)))) (and (or (= (+ c_main_~r~0 (* .cse0 .cse1)) c_main_~A~0) .cse2 .cse3) (exists ((v_main_~b~0_32 Int)) (let ((.cse5 (+ c_main_~b~0 c_main_~r~0)) (.cse4 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (<= .cse4 .cse5) (= (+ .cse5 (* (div (+ (* (- 1) c_main_~q~0) 1) (- 2)) v_main_~b~0_32)) c_main_~A~0) (= (div v_main_~b~0_32 2) c_main_~b~0) (< .cse5 v_main_~b~0_32) (= (mod .cse4 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))) (or (= c_main_~A~0 (+ .cse6 (* .cse7 .cse8))) .cse9) (= 0 (mod c_main_~b~0 (- 2))) (or (= c_main_~A~0 (+ (* .cse0 .cse7) .cse6)) .cse2 .cse3) (= c_main_~A~0 (+ (* c_main_~b~0 c_main_~q~0) c_main_~r~0)) (or .cse9 (= (+ (* .cse1 .cse8) c_main_~r~0) c_main_~A~0)) (= (mod (+ c_main_~q~0 1) (- 2)) 0)))) is different from false [2019-09-05 13:17:00,105 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-05 13:17:18,305 WARN L188 SmtUtils]: Spent 13.65 s on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2019-09-05 13:17:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:21,127 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-09-05 13:17:21,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 13:17:21,130 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-09-05 13:17:21,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:21,136 INFO L225 Difference]: With dead ends: 47 [2019-09-05 13:17:21,136 INFO L226 Difference]: Without dead ends: 47 [2019-09-05 13:17:21,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 41.9s TimeCoverageRelationStatistics Valid=121, Invalid=580, Unknown=13, NotChecked=156, Total=870 [2019-09-05 13:17:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-05 13:17:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-09-05 13:17:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-05 13:17:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-05 13:17:21,149 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2019-09-05 13:17:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:21,150 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-05 13:17:21,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 13:17:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-05 13:17:21,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 13:17:21,154 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:21,154 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:21,154 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:21,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:21,155 INFO L82 PathProgramCache]: Analyzing trace with hash 836866802, now seen corresponding path program 1 times [2019-09-05 13:17:21,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:21,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:21,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:21,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:21,171 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:21,172 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:21,172 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:21,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:21,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:21,211 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2019-09-05 13:17:21,211 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [29], [33], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65] [2019-09-05 13:17:21,215 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-05 13:17:21,215 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-05 13:17:21,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-05 13:17:21,257 INFO L272 AbstractInterpreter]: Visited 16 different actions 39 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 63 root evaluator evaluations with a maximum evaluation depth of 8. Performed 63 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 2 different actions. Largest state had 7 variables. [2019-09-05 13:17:21,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:21,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-05 13:17:21,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:21,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:21,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:21,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-05 13:17:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:21,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-05 13:17:21,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:21,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-05 13:17:21,325 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:21,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:21,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-05 13:17:21,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:21,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-05 13:17:21,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:21,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 13:17:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 13:17:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-05 13:17:21,405 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 9 states. [2019-09-05 13:17:21,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:21,495 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-09-05 13:17:21,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 13:17:21,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-09-05 13:17:21,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:21,497 INFO L225 Difference]: With dead ends: 48 [2019-09-05 13:17:21,497 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 13:17:21,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-05 13:17:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 13:17:21,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 13:17:21,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 13:17:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-05 13:17:21,508 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 38 [2019-09-05 13:17:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:21,508 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-05 13:17:21,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 13:17:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-05 13:17:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 13:17:21,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:21,511 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:21,511 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash 2054940077, now seen corresponding path program 4 times [2019-09-05 13:17:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:21,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:21,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:21,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:21,537 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:21,537 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:21,537 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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) [2019-09-05 13:17:21,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:21,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:21,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:21,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:21,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:21,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 13:17:21,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:21,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:21,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 13:17:21,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:17:21,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:22,079 WARN L188 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-05 13:17:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:17:22,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:22,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-05 13:17:22,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:22,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 13:17:22,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 13:17:22,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:22,131 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2019-09-05 13:17:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:22,209 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-05 13:17:22,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 13:17:22,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-09-05 13:17:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:22,210 INFO L225 Difference]: With dead ends: 56 [2019-09-05 13:17:22,211 INFO L226 Difference]: Without dead ends: 45 [2019-09-05 13:17:22,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-05 13:17:22,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-05 13:17:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-05 13:17:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-05 13:17:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-09-05 13:17:22,216 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 40 [2019-09-05 13:17:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:22,216 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-09-05 13:17:22,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 13:17:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-09-05 13:17:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 13:17:22,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:22,218 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:22,218 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 632581416, now seen corresponding path program 5 times [2019-09-05 13:17:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:22,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 13:17:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:22,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:22,226 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:22,226 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:22,226 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:22,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:22,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:22,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:22,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:22,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:22,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:22,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 13:17:22,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-05 13:17:22,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 13:17:22,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:17:22,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-05 13:17:22,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:22,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:22,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:25,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:25,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:25,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:17:25,793 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:25,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:26,165 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-09-05 13:17:26,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:27,364 WARN L188 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-05 13:17:27,774 WARN L188 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-05 13:17:27,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 13:17:30,211 WARN L188 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-09-05 13:17:30,801 WARN L188 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2019-09-05 13:17:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-05 13:17:31,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 13:17:31,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-05 13:17:31,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-05 13:17:31,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-05 13:17:31,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-05 13:17:31,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2019-09-05 13:17:31,174 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 25 states. [2019-09-05 13:17:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 13:17:44,745 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-09-05 13:17:44,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 13:17:44,746 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-09-05 13:17:44,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 13:17:44,748 INFO L225 Difference]: With dead ends: 64 [2019-09-05 13:17:44,748 INFO L226 Difference]: Without dead ends: 64 [2019-09-05 13:17:44,748 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=110, Invalid=538, Unknown=2, NotChecked=0, Total=650 [2019-09-05 13:17:44,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-05 13:17:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2019-09-05 13:17:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-05 13:17:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-05 13:17:44,755 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 42 [2019-09-05 13:17:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 13:17:44,755 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-05 13:17:44,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-05 13:17:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-05 13:17:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 13:17:44,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 13:17:44,757 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 13:17:44,757 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 13:17:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 13:17:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1597921643, now seen corresponding path program 6 times [2019-09-05 13:17:44,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-05 13:17:44,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:44,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:44,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 13:17:44,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-05 13:17:44,764 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-05 13:17:44,764 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-05 13:17:44,765 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-05 13:17:44,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 13:17:44,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-05 13:17:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 13:17:44,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-05 13:17:44,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-05 13:17:44,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 13:17:44,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 13:17:44,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 13:17:44,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-05 13:17:44,835 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 13:17:44,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 13:17:44,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-05 13:17:44,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 13:17:45,001 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:17:45,001 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-05 13:17:45,377 WARN L188 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-05 13:17:45,739 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-09-05 13:17:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-05 13:17:45,937 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.forceShutdown(MonitoredProcess.java:403) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.exit(Executor.java:135) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.exit(Scriptor.java:213) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-05 13:17:45,943 INFO L168 Benchmark]: Toolchain (without parser) took 73858.03 ms. Allocated memory was 132.1 MB in the beginning and 313.5 MB in the end (delta: 181.4 MB). Free memory was 87.9 MB in the beginning and 141.3 MB in the end (delta: -53.4 MB). Peak memory consumption was 128.0 MB. Max. memory is 7.1 GB. [2019-09-05 13:17:45,944 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 13:17:45,946 INFO L168 Benchmark]: CACSL2BoogieTranslator took 223.44 ms. Allocated memory is still 132.1 MB. Free memory was 87.7 MB in the beginning and 78.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-05 13:17:45,947 INFO L168 Benchmark]: Boogie Preprocessor took 116.81 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 78.3 MB in the beginning and 176.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-05 13:17:45,948 INFO L168 Benchmark]: RCFGBuilder took 248.71 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 164.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. [2019-09-05 13:17:45,953 INFO L168 Benchmark]: TraceAbstraction took 73255.41 ms. Allocated memory was 199.8 MB in the beginning and 313.5 MB in the end (delta: 113.8 MB). Free memory was 163.7 MB in the beginning and 141.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. [2019-09-05 13:17:45,965 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 223.44 ms. Allocated memory is still 132.1 MB. Free memory was 87.7 MB in the beginning and 78.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 116.81 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 78.3 MB in the beginning and 176.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 248.71 ms. Allocated memory is still 199.8 MB. Free memory was 176.1 MB in the beginning and 164.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 73255.41 ms. Allocated memory was 199.8 MB in the beginning and 313.5 MB in the end (delta: 113.8 MB). Free memory was 163.7 MB in the beginning and 141.3 MB in the end (delta: 22.3 MB). Peak memory consumption was 136.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.forceShutdown(MonitoredProcess.java:403) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...