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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/prod4br.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 12:58:59,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 12:58:59,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 12:58:59,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 12:58:59,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 12:58:59,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 12:58:59,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 12:58:59,312 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 12:58:59,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 12:58:59,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 12:58:59,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 12:58:59,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 12:58:59,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 12:58:59,329 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 12:58:59,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 12:58:59,332 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 12:58:59,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 12:58:59,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 12:58:59,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 12:58:59,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 12:58:59,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 12:58:59,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 12:58:59,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 12:58:59,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 12:58:59,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 12:58:59,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 12:58:59,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 12:58:59,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 12:58:59,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 12:58:59,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 12:58:59,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 12:58:59,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 12:58:59,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 12:58:59,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 12:58:59,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 12:58:59,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 12:58:59,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 12:58:59,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 12:58:59,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 12:58:59,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 12:58:59,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 12:58:59,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 12:58:59,383 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 12:58:59,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 12:58:59,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 12:58:59,386 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 12:58:59,386 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 12:58:59,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 12:58:59,387 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 12:58:59,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 12:58:59,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 12:58:59,388 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 12:58:59,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 12:58:59,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 12:58:59,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 12:58:59,390 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 12:58:59,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 12:58:59,390 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 12:58:59,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 12:58:59,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 12:58:59,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 12:58:59,391 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 12:58:59,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 12:58:59,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 12:58:59,392 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 12:58:59,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 12:58:59,393 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 12:58:59,393 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 12:58:59,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 12:58:59,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 12:58:59,393 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 12:58:59,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 12:58:59,468 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 12:58:59,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 12:58:59,473 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 12:58:59,474 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 12:58:59,474 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br.c [2019-09-20 12:58:59,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3729db995/df1fcad09fd94b2fad119544439f4ca0/FLAGe0ef47b70 [2019-09-20 12:59:00,007 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 12:59:00,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br.c [2019-09-20 12:59:00,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3729db995/df1fcad09fd94b2fad119544439f4ca0/FLAGe0ef47b70 [2019-09-20 12:59:00,371 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3729db995/df1fcad09fd94b2fad119544439f4ca0 [2019-09-20 12:59:00,380 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 12:59:00,382 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 12:59:00,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:00,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 12:59:00,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 12:59:00,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,389 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a8eca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00, skipping insertion in model container [2019-09-20 12:59:00,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,396 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 12:59:00,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 12:59:00,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:00,577 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 12:59:00,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 12:59:00,611 INFO L192 MainTranslator]: Completed translation [2019-09-20 12:59:00,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00 WrapperNode [2019-09-20 12:59:00,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 12:59:00,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 12:59:00,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 12:59:00,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 12:59:00,701 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (1/1) ... [2019-09-20 12:59:00,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 12:59:00,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 12:59:00,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 12:59:00,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 12:59:00,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (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-20 12:59:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 12:59:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 12:59:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 12:59:00,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 12:59:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 12:59:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 12:59:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 12:59:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 12:59:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 12:59:00,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 12:59:00,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 12:59:00,994 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 12:59:00,994 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-20 12:59:00,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:00 BoogieIcfgContainer [2019-09-20 12:59:00,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 12:59:00,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 12:59:00,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 12:59:01,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 12:59:01,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 12:59:00" (1/3) ... [2019-09-20 12:59:01,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7bd705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:01, skipping insertion in model container [2019-09-20 12:59:01,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 12:59:00" (2/3) ... [2019-09-20 12:59:01,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7bd705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 12:59:01, skipping insertion in model container [2019-09-20 12:59:01,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 12:59:00" (3/3) ... [2019-09-20 12:59:01,003 INFO L109 eAbstractionObserver]: Analyzing ICFG prod4br.c [2019-09-20 12:59:01,013 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 12:59:01,020 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 12:59:01,038 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 12:59:01,062 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 12:59:01,063 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 12:59:01,063 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 12:59:01,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 12:59:01,063 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 12:59:01,063 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 12:59:01,064 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 12:59:01,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 12:59:01,064 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 12:59:01,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-20 12:59:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 12:59:01,083 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:01,084 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:01,086 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 152624894, now seen corresponding path program 1 times [2019-09-20 12:59:01,091 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:01,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:01,193 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-20 12:59:01,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:01,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 12:59:01,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 12:59:01,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 12:59:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 12:59:01,210 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-20 12:59:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:01,234 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2019-09-20 12:59:01,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 12:59:01,236 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-20 12:59:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:01,246 INFO L225 Difference]: With dead ends: 43 [2019-09-20 12:59:01,246 INFO L226 Difference]: Without dead ends: 19 [2019-09-20 12:59:01,250 INFO L636 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-20 12:59:01,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-20 12:59:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-20 12:59:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-20 12:59:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-09-20 12:59:01,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2019-09-20 12:59:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:01,292 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-09-20 12:59:01,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 12:59:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-09-20 12:59:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-20 12:59:01,293 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:01,294 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:01,294 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash 130400808, now seen corresponding path program 1 times [2019-09-20 12:59:01,295 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:01,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:01,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:01,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:01,304 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:01,304 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:01,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:59:01,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:01,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 12:59:01,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:01,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:01,528 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-20 12:59:01,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:01,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 12:59:01,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:01,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:01,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:01,536 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2019-09-20 12:59:01,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:01,661 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-09-20 12:59:01,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 12:59:01,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-20 12:59:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:01,663 INFO L225 Difference]: With dead ends: 33 [2019-09-20 12:59:01,663 INFO L226 Difference]: Without dead ends: 31 [2019-09-20 12:59:01,664 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-20 12:59:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-20 12:59:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-20 12:59:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-09-20 12:59:01,677 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 10 [2019-09-20 12:59:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:01,678 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-09-20 12:59:01,678 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-09-20 12:59:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 12:59:01,679 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:01,679 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:01,680 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1836845457, now seen corresponding path program 1 times [2019-09-20 12:59:01,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:01,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:01,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:01,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:01,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:01,693 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:01,694 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:01,694 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:01,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:01,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-20 12:59:01,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:01,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:01,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:01,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:01,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-20 12:59:01,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:59:01,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:59:01,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:01,887 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 9 states. [2019-09-20 12:59:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:02,390 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-20 12:59:02,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:02,391 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-09-20 12:59:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:02,395 INFO L225 Difference]: With dead ends: 39 [2019-09-20 12:59:02,395 INFO L226 Difference]: Without dead ends: 37 [2019-09-20 12:59:02,396 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:02,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-20 12:59:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-20 12:59:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-20 12:59:02,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-09-20 12:59:02,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 16 [2019-09-20 12:59:02,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:02,415 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-09-20 12:59:02,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:59:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2019-09-20 12:59:02,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 12:59:02,417 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:02,418 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:02,418 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:02,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 682822634, now seen corresponding path program 1 times [2019-09-20 12:59:02,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:02,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:02,439 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:02,439 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:02,439 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:59:02,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:02,481 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:59:02,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:02,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:02,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:02,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-20 12:59:02,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:59:02,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:59:02,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:02,697 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 9 states. [2019-09-20 12:59:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:03,097 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2019-09-20 12:59:03,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:03,099 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-09-20 12:59:03,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:03,101 INFO L225 Difference]: With dead ends: 55 [2019-09-20 12:59:03,103 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 12:59:03,104 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 12:59:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2019-09-20 12:59:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 12:59:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-09-20 12:59:03,124 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 18 [2019-09-20 12:59:03,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:03,124 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-09-20 12:59:03,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:59:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-09-20 12:59:03,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 12:59:03,126 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:03,126 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:03,127 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:03,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:03,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1827366173, now seen corresponding path program 1 times [2019-09-20 12:59:03,128 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:03,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:03,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:03,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:03,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:03,134 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:03,134 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:03,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:03,168 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:59:03,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:03,258 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (mod c_main_~b~0 2)) (.cse15 (mod c_main_~x~0 2))) (let ((.cse11 (= 0 .cse15)) (.cse10 (= .cse16 0))) (let ((.cse7 (<= 0 c_main_~x~0)) (.cse5 (= 1 .cse15)) (.cse0 (not .cse10)) (.cse2 (= .cse16 2)) (.cse8 (< c_main_~b~0 0)) (.cse12 (= .cse15 3)) (.cse13 (not .cse11)) (.cse1 (= c_main_~p~0 1)) (.cse3 (= c_main_~b~0 c_main_~y~0)) (.cse4 (<= 1 c_main_~y~0)) (.cse14 (< c_main_~x~0 0)) (.cse6 (exists ((v_main_~q~0_14 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_main_~q~0_14)) (= (* c_main_~y~0 c_main_~x~0) (+ v_main_~q~0_14 (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0)))))) (.cse9 (= (+ c_main_~a~0 1) c_main_~x~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse12 .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse8 .cse9) (and .cse12 .cse13 .cse10 .cse1 .cse3 .cse4 .cse14 .cse6 .cse9))))) is different from false [2019-09-20 12:59:03,298 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_main_~x~0 2)) (.cse14 (mod c_main_~b~0 2))) (let ((.cse12 (= .cse14 0)) (.cse9 (= 0 .cse15))) (let ((.cse6 (<= 0 c_main_~x~0)) (.cse5 (= 1 .cse15)) (.cse10 (= .cse15 3)) (.cse11 (not .cse9)) (.cse0 (not .cse12)) (.cse1 (= c_main_~p~0 1)) (.cse2 (= .cse14 2)) (.cse3 (= c_main_~b~0 c_main_~y~0)) (.cse4 (<= 1 c_main_~y~0)) (.cse13 (< c_main_~x~0 0)) (.cse7 (< c_main_~b~0 0)) (.cse8 (= (+ c_main_~a~0 1) c_main_~x~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_main_~q~0_14 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_main_~q~0_14)) (= (* c_main_~y~0 c_main_~x~0) (+ v_main_~q~0_14 (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0))))) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (exists ((v_prenex_3 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_3)) (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_3)))) .cse5 .cse7 .cse8) (and .cse10 .cse11 .cse12 .cse1 .cse3 .cse4 .cse13 (exists ((v_prenex_5 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_5)) (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_5)))) .cse8) (and .cse12 .cse1 .cse3 .cse4 (exists ((v_prenex_1 Int)) (and (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_1)) (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_1)))) .cse5 .cse6 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse9 .cse5 .cse8 (exists ((v_prenex_2 Int)) (and (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_2)) (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_2))))) (and .cse10 .cse11 .cse0 (exists ((v_prenex_4 Int)) (and (= (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_4) (* c_main_~y~0 c_main_~x~0)) (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_4)))) .cse1 .cse2 .cse3 .cse4 .cse13 .cse7 .cse8))))) is different from false [2019-09-20 12:59:03,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:03,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-20 12:59:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-09-20 12:59:03,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:03,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:03,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:03,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:03,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2019-09-20 12:59:03,404 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 10 states. [2019-09-20 12:59:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:03,555 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-09-20 12:59:03,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:03,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-20 12:59:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:03,557 INFO L225 Difference]: With dead ends: 55 [2019-09-20 12:59:03,557 INFO L226 Difference]: Without dead ends: 53 [2019-09-20 12:59:03,558 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=66, Unknown=2, NotChecked=34, Total=132 [2019-09-20 12:59:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-20 12:59:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-09-20 12:59:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-20 12:59:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-20 12:59:03,580 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 19 [2019-09-20 12:59:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:03,581 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-20 12:59:03,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-20 12:59:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 12:59:03,583 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:03,583 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:03,583 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:03,583 INFO L82 PathProgramCache]: Analyzing trace with hash 560958013, now seen corresponding path program 1 times [2019-09-20 12:59:03,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:03,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:03,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:03,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:03,595 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:03,595 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:03,595 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:03,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:03,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:59:03,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:03,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:03,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:03,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:03,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:03,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:03,666 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2019-09-20 12:59:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:03,750 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-09-20 12:59:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:03,751 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-20 12:59:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:03,752 INFO L225 Difference]: With dead ends: 64 [2019-09-20 12:59:03,752 INFO L226 Difference]: Without dead ends: 52 [2019-09-20 12:59:03,753 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:03,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-20 12:59:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-20 12:59:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-20 12:59:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-09-20 12:59:03,765 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 21 [2019-09-20 12:59:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:03,765 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-09-20 12:59:03,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-09-20 12:59:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:03,766 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:03,766 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:03,767 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1203344027, now seen corresponding path program 1 times [2019-09-20 12:59:03,767 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:03,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:03,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:03,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:03,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:03,774 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:03,774 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:03,774 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:59:03,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:03,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-20 12:59:03,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:03,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:04,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:04,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-20 12:59:04,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 12:59:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 12:59:04,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:04,019 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 9 states. [2019-09-20 12:59:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:04,373 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-09-20 12:59:04,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:04,374 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-20 12:59:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:04,376 INFO L225 Difference]: With dead ends: 78 [2019-09-20 12:59:04,376 INFO L226 Difference]: Without dead ends: 64 [2019-09-20 12:59:04,377 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:04,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-20 12:59:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-20 12:59:04,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-20 12:59:04,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-09-20 12:59:04,389 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 20 [2019-09-20 12:59:04,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:04,390 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-09-20 12:59:04,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 12:59:04,390 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-09-20 12:59:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 12:59:04,391 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:04,391 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:04,391 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:04,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1146085725, now seen corresponding path program 1 times [2019-09-20 12:59:04,392 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:04,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:04,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:04,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:04,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:04,397 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:04,397 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:04,397 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:59:04,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:04,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-20 12:59:04,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:04,601 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-09-20 12:59:04,883 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-09-20 12:59:04,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 12:59:04,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:04,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:04,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:04,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:04,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:04,934 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 10 states. [2019-09-20 12:59:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:05,832 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2019-09-20 12:59:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 12:59:05,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-20 12:59:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:05,834 INFO L225 Difference]: With dead ends: 88 [2019-09-20 12:59:05,834 INFO L226 Difference]: Without dead ends: 74 [2019-09-20 12:59:05,835 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-20 12:59:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-09-20 12:59:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 12:59:05,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2019-09-20 12:59:05,846 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 20 [2019-09-20 12:59:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:05,847 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2019-09-20 12:59:05,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:05,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2019-09-20 12:59:05,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-20 12:59:05,848 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:05,848 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:05,849 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1259300529, now seen corresponding path program 1 times [2019-09-20 12:59:05,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:05,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:05,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:05,855 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:05,855 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:05,855 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:05,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-20 12:59:05,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:05,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:05,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:05,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:05,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:06,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:07,637 WARN L191 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-09-20 12:59:07,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:07,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:07,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:07,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:07,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=69, Unknown=2, NotChecked=0, Total=90 [2019-09-20 12:59:07,670 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand 10 states. [2019-09-20 12:59:14,025 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-20 12:59:26,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:26,173 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-09-20 12:59:26,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 12:59:26,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-20 12:59:26,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:26,176 INFO L225 Difference]: With dead ends: 85 [2019-09-20 12:59:26,176 INFO L226 Difference]: Without dead ends: 78 [2019-09-20 12:59:26,177 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=45, Invalid=163, Unknown=2, NotChecked=0, Total=210 [2019-09-20 12:59:26,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-20 12:59:26,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-20 12:59:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 12:59:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2019-09-20 12:59:26,189 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 24 [2019-09-20 12:59:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:26,190 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2019-09-20 12:59:26,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:26,190 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2019-09-20 12:59:26,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:59:26,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:26,191 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:26,191 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash -333220948, now seen corresponding path program 2 times [2019-09-20 12:59:26,192 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:26,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:26,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:26,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:26,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:26,197 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:26,197 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:26,198 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:26,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:26,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:26,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:26,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-20 12:59:26,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:26,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:26,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:26,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:26,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:26,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2019-09-20 12:59:26,589 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 10 states. [2019-09-20 12:59:30,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:30,924 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2019-09-20 12:59:30,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:30,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-20 12:59:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:30,926 INFO L225 Difference]: With dead ends: 94 [2019-09-20 12:59:30,927 INFO L226 Difference]: Without dead ends: 92 [2019-09-20 12:59:30,928 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2019-09-20 12:59:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-20 12:59:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-09-20 12:59:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-20 12:59:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-09-20 12:59:30,940 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 26 [2019-09-20 12:59:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:30,940 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-09-20 12:59:30,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-09-20 12:59:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:59:30,941 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:30,942 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:30,942 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:30,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:30,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1198817260, now seen corresponding path program 1 times [2019-09-20 12:59:30,942 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:30,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:30,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:30,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:30,953 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:30,953 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:30,953 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:30,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:30,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-20 12:59:30,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:31,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:31,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:31,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:31,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:31,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:31,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:31,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:31,063 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 10 states. [2019-09-20 12:59:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:33,551 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2019-09-20 12:59:33,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:33,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-20 12:59:33,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:33,563 INFO L225 Difference]: With dead ends: 110 [2019-09-20 12:59:33,563 INFO L226 Difference]: Without dead ends: 107 [2019-09-20 12:59:33,564 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-20 12:59:33,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-20 12:59:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2019-09-20 12:59:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-20 12:59:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-09-20 12:59:33,580 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 26 [2019-09-20 12:59:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:33,581 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-09-20 12:59:33,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-09-20 12:59:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 12:59:33,582 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:33,583 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:33,583 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:33,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:33,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1456982698, now seen corresponding path program 1 times [2019-09-20 12:59:33,583 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:33,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:33,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:33,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:33,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:33,610 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:33,610 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:33,610 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:33,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:33,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 12:59:33,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:33,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:33,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:33,731 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:33,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:33,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:33,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:33,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:33,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:33,736 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 10 states. [2019-09-20 12:59:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:34,317 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2019-09-20 12:59:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:34,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-20 12:59:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:34,318 INFO L225 Difference]: With dead ends: 118 [2019-09-20 12:59:34,318 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 12:59:34,319 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-20 12:59:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 12:59:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-09-20 12:59:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-20 12:59:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2019-09-20 12:59:34,331 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 26 [2019-09-20 12:59:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:34,332 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2019-09-20 12:59:34,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2019-09-20 12:59:34,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:59:34,333 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:34,333 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:34,333 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:34,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:34,334 INFO L82 PathProgramCache]: Analyzing trace with hash 394786203, now seen corresponding path program 1 times [2019-09-20 12:59:34,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:34,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:34,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:34,339 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:34,339 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:34,339 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:34,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:34,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-20 12:59:34,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:35,273 WARN L191 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-20 12:59:35,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:35,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:35,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:35,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:35,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:35,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:35,312 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand 10 states. [2019-09-20 12:59:35,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:35,950 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2019-09-20 12:59:35,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:35,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-20 12:59:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:35,952 INFO L225 Difference]: With dead ends: 111 [2019-09-20 12:59:35,952 INFO L226 Difference]: Without dead ends: 109 [2019-09-20 12:59:35,953 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-09-20 12:59:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-09-20 12:59:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-20 12:59:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2019-09-20 12:59:35,964 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 27 [2019-09-20 12:59:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:35,964 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2019-09-20 12:59:35,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:35,965 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2019-09-20 12:59:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 12:59:35,966 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:35,966 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:35,966 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:35,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:35,966 INFO L82 PathProgramCache]: Analyzing trace with hash -862656033, now seen corresponding path program 2 times [2019-09-20 12:59:35,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:35,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:35,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:35,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:35,972 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:35,972 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:35,972 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:36,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:36,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:36,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:59:36,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:36,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,362 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2019-09-20 12:59:36,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:36,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:36,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-20 12:59:36,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:36,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:36,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-20 12:59:36,434 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand 11 states. [2019-09-20 12:59:36,631 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod c_main_~b~0 2) 0) (= c_main_~p~0 1) (= c_main_~b~0 c_main_~y~0) (<= 1 c_main_~y~0) (exists ((v_main_~a~0_26 Int)) (and (<= 0 v_main_~a~0_26) (<= v_main_~a~0_26 (+ c_main_~a~0 1)) (= (mod v_main_~a~0_26 2) 1) (not (= 0 v_main_~a~0_26)))) (not (= c_main_~a~0 0)) (= (+ c_main_~q~0 (* c_main_~p~0 (* c_main_~b~0 c_main_~a~0))) (* c_main_~y~0 c_main_~x~0))) is different from false [2019-09-20 12:59:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:38,808 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2019-09-20 12:59:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 12:59:38,809 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-20 12:59:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:38,812 INFO L225 Difference]: With dead ends: 120 [2019-09-20 12:59:38,812 INFO L226 Difference]: Without dead ends: 118 [2019-09-20 12:59:38,813 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2019-09-20 12:59:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-20 12:59:38,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2019-09-20 12:59:38,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-20 12:59:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2019-09-20 12:59:38,825 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 27 [2019-09-20 12:59:38,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:38,825 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2019-09-20 12:59:38,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:38,826 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2019-09-20 12:59:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:59:38,827 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:38,827 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:38,827 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1631317159, now seen corresponding path program 1 times [2019-09-20 12:59:38,828 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:38,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:38,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:38,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:38,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:38,833 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:38,833 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:38,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:38,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:38,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-20 12:59:38,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:39,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:39,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:39,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:39,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:39,152 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand 10 states. [2019-09-20 12:59:39,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:39,430 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2019-09-20 12:59:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:39,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-20 12:59:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:39,431 INFO L225 Difference]: With dead ends: 120 [2019-09-20 12:59:39,431 INFO L226 Difference]: Without dead ends: 118 [2019-09-20 12:59:39,432 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-20 12:59:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2019-09-20 12:59:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-20 12:59:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2019-09-20 12:59:39,445 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 28 [2019-09-20 12:59:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:39,445 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2019-09-20 12:59:39,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2019-09-20 12:59:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:59:39,446 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:39,446 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:39,447 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1688575461, now seen corresponding path program 1 times [2019-09-20 12:59:39,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:39,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:39,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:39,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:39,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:39,452 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:39,452 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:39,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:39,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:39,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-20 12:59:39,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:39,807 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-09-20 12:59:40,106 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2019-09-20 12:59:40,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:40,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:40,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-20 12:59:40,147 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 12:59:40,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 12:59:40,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2019-09-20 12:59:40,148 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand 11 states. [2019-09-20 12:59:40,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:40,684 INFO L93 Difference]: Finished difference Result 149 states and 196 transitions. [2019-09-20 12:59:40,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 12:59:40,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-20 12:59:40,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:40,686 INFO L225 Difference]: With dead ends: 149 [2019-09-20 12:59:40,686 INFO L226 Difference]: Without dead ends: 127 [2019-09-20 12:59:40,687 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=121, Unknown=1, NotChecked=0, Total=156 [2019-09-20 12:59:40,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-20 12:59:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2019-09-20 12:59:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 12:59:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2019-09-20 12:59:40,699 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 157 transitions. Word has length 28 [2019-09-20 12:59:40,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:40,700 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-09-20 12:59:40,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 12:59:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 157 transitions. [2019-09-20 12:59:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:59:40,701 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:40,701 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:40,701 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:40,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1671899687, now seen corresponding path program 2 times [2019-09-20 12:59:40,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:40,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:40,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:40,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:40,707 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:40,707 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:40,707 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:40,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:40,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:40,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:40,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-20 12:59:40,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:40,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:40,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:40,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:40,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:40,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:40,976 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. Second operand 10 states. [2019-09-20 12:59:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:43,792 INFO L93 Difference]: Finished difference Result 163 states and 216 transitions. [2019-09-20 12:59:43,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:43,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-20 12:59:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:43,793 INFO L225 Difference]: With dead ends: 163 [2019-09-20 12:59:43,793 INFO L226 Difference]: Without dead ends: 136 [2019-09-20 12:59:43,794 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-20 12:59:43,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2019-09-20 12:59:43,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 12:59:43,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2019-09-20 12:59:43,806 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 28 [2019-09-20 12:59:43,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:43,806 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2019-09-20 12:59:43,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2019-09-20 12:59:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 12:59:43,807 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:43,807 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:43,808 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:43,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash 660782437, now seen corresponding path program 2 times [2019-09-20 12:59:43,808 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:43,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:43,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:43,813 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:43,813 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:43,813 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-20 12:59:43,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 12:59:43,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:43,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:43,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-20 12:59:43,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:43,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:43,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:44,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 12:59:44,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:44,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-20 12:59:44,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 12:59:44,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 12:59:44,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-20 12:59:44,062 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand 10 states. [2019-09-20 12:59:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:46,379 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2019-09-20 12:59:46,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 12:59:46,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-20 12:59:46,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:46,382 INFO L225 Difference]: With dead ends: 157 [2019-09-20 12:59:46,383 INFO L226 Difference]: Without dead ends: 155 [2019-09-20 12:59:46,383 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-20 12:59:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-20 12:59:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2019-09-20 12:59:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-20 12:59:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2019-09-20 12:59:46,395 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 28 [2019-09-20 12:59:46,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:46,396 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2019-09-20 12:59:46,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 12:59:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2019-09-20 12:59:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 12:59:46,397 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:46,397 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:46,397 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:46,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:46,397 INFO L82 PathProgramCache]: Analyzing trace with hash -349658598, now seen corresponding path program 1 times [2019-09-20 12:59:46,398 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:46,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 12:59:46,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,402 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:46,402 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:46,402 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:46,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:46,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-20 12:59:46,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:46,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:46,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 12:59:46,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 12:59:46,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 12:59:46,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 12:59:46,488 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2019-09-20 12:59:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:46,522 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2019-09-20 12:59:46,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 12:59:46,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 12:59:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:46,523 INFO L225 Difference]: With dead ends: 169 [2019-09-20 12:59:46,524 INFO L226 Difference]: Without dead ends: 142 [2019-09-20 12:59:46,524 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-20 12:59:46,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-20 12:59:46,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-09-20 12:59:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-20 12:59:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2019-09-20 12:59:46,539 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 29 [2019-09-20 12:59:46,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:46,539 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2019-09-20 12:59:46,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 12:59:46,540 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2019-09-20 12:59:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:59:46,540 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:46,541 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:46,541 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1615173920, now seen corresponding path program 1 times [2019-09-20 12:59:46,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:46,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:46,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:46,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,546 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:46,546 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:46,546 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:46,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:46,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 12:59:46,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:46,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 12:59:46,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 12:59:46,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 12:59:46,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 12:59:46,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:46,631 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand 6 states. [2019-09-20 12:59:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:46,705 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2019-09-20 12:59:46,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:46,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-20 12:59:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:46,707 INFO L225 Difference]: With dead ends: 146 [2019-09-20 12:59:46,707 INFO L226 Difference]: Without dead ends: 138 [2019-09-20 12:59:46,707 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:46,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-20 12:59:46,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-09-20 12:59:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-20 12:59:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2019-09-20 12:59:46,721 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 31 [2019-09-20 12:59:46,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:46,721 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2019-09-20 12:59:46,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 12:59:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2019-09-20 12:59:46,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:59:46,722 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:46,722 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:46,723 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 169189792, now seen corresponding path program 1 times [2019-09-20 12:59:46,723 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:46,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:46,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:46,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,727 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:46,727 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:46,728 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:59:46,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:46,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 12:59:46,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 12:59:46,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:46,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-20 12:59:46,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 12:59:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 12:59:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 12:59:46,830 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 5 states. [2019-09-20 12:59:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:46,906 INFO L93 Difference]: Finished difference Result 220 states and 296 transitions. [2019-09-20 12:59:46,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 12:59:46,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-20 12:59:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:46,908 INFO L225 Difference]: With dead ends: 220 [2019-09-20 12:59:46,908 INFO L226 Difference]: Without dead ends: 142 [2019-09-20 12:59:46,912 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-20 12:59:46,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-20 12:59:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-09-20 12:59:46,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-20 12:59:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2019-09-20 12:59:46,928 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 30 [2019-09-20 12:59:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:46,928 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2019-09-20 12:59:46,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 12:59:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2019-09-20 12:59:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 12:59:46,930 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:46,930 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:46,930 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:46,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:46,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1091445474, now seen corresponding path program 1 times [2019-09-20 12:59:46,931 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:46,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:46,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:46,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:46,936 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:46,936 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:46,936 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:46,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 12:59:46,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-20 12:59:46,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 12:59:47,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 12:59:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 12:59:47,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-20 12:59:47,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-20 12:59:47,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 12:59:47,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 12:59:47,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 12:59:47,037 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand 7 states. [2019-09-20 12:59:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 12:59:47,162 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2019-09-20 12:59:47,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 12:59:47,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-20 12:59:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 12:59:47,166 INFO L225 Difference]: With dead ends: 146 [2019-09-20 12:59:47,166 INFO L226 Difference]: Without dead ends: 133 [2019-09-20 12:59:47,167 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-20 12:59:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-20 12:59:47,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2019-09-20 12:59:47,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-20 12:59:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2019-09-20 12:59:47,181 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 31 [2019-09-20 12:59:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 12:59:47,181 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2019-09-20 12:59:47,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 12:59:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2019-09-20 12:59:47,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 12:59:47,183 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 12:59:47,183 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 12:59:47,183 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 12:59:47,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 12:59:47,183 INFO L82 PathProgramCache]: Analyzing trace with hash -909136864, now seen corresponding path program 2 times [2019-09-20 12:59:47,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 12:59:47,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 12:59:47,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 12:59:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 12:59:47,199 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-20 12:59:47,199 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-20 12:59:47,200 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-20 12:59:47,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-20 12:59:47,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 12:59:47,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 12:59:47,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-20 12:59:47,249 INFO L279 TraceCheckSpWp]: Computing forward predicates...