java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/bitvector/modulus-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-09 05:44:04,749 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-09 05:44:04,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-09 05:44:04,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-09 05:44:04,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-09 05:44:04,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-09 05:44:04,767 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-09 05:44:04,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-09 05:44:04,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-09 05:44:04,772 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-09 05:44:04,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-09 05:44:04,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-09 05:44:04,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-09 05:44:04,775 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-09 05:44:04,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-09 05:44:04,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-09 05:44:04,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-09 05:44:04,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-09 05:44:04,781 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-09 05:44:04,783 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-09 05:44:04,784 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-09 05:44:04,785 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-09 05:44:04,786 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-09 05:44:04,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-09 05:44:04,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-09 05:44:04,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-09 05:44:04,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-09 05:44:04,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-09 05:44:04,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-09 05:44:04,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-09 05:44:04,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-09 05:44:04,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-09 05:44:04,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-09 05:44:04,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-09 05:44:04,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-09 05:44:04,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-09 05:44:04,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-09 05:44:04,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-09 05:44:04,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-09 05:44:04,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-09 05:44:04,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-09 05:44:04,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-09 05:44:04,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-09 05:44:04,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-09 05:44:04,816 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-09 05:44:04,816 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-09 05:44:04,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-09 05:44:04,817 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-09 05:44:04,817 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-09 05:44:04,817 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-09 05:44:04,818 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-09 05:44:04,818 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-09 05:44:04,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-09 05:44:04,819 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-09 05:44:04,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-09 05:44:04,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-09 05:44:04,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-09 05:44:04,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-09 05:44:04,820 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-09 05:44:04,820 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-09 05:44:04,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-09 05:44:04,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-09 05:44:04,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-09 05:44:04,821 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-09 05:44:04,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-09 05:44:04,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-09 05:44:04,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-09 05:44:04,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-09 05:44:04,822 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-09 05:44:04,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-09 05:44:04,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-09 05:44:04,822 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-09 05:44:04,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-09 05:44:04,865 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-09 05:44:04,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-09 05:44:04,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-09 05:44:04,870 INFO L275 PluginConnector]: CDTParser initialized [2019-09-09 05:44:04,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/modulus-2.i [2019-09-09 05:44:04,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91326e8dc/06b031c6d2de4c378b67acb9a0563d61/FLAG3ac058660 [2019-09-09 05:44:05,407 INFO L306 CDTParser]: Found 1 translation units. [2019-09-09 05:44:05,408 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/modulus-2.i [2019-09-09 05:44:05,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91326e8dc/06b031c6d2de4c378b67acb9a0563d61/FLAG3ac058660 [2019-09-09 05:44:05,806 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91326e8dc/06b031c6d2de4c378b67acb9a0563d61 [2019-09-09 05:44:05,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-09 05:44:05,818 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-09 05:44:05,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:05,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-09 05:44:05,823 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-09 05:44:05,824 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:05" (1/1) ... [2019-09-09 05:44:05,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f71350 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:05, skipping insertion in model container [2019-09-09 05:44:05,827 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.09 05:44:05" (1/1) ... [2019-09-09 05:44:05,835 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-09 05:44:05,858 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-09 05:44:06,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:06,077 INFO L188 MainTranslator]: Completed pre-run [2019-09-09 05:44:06,094 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-09 05:44:06,107 INFO L192 MainTranslator]: Completed translation [2019-09-09 05:44:06,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06 WrapperNode [2019-09-09 05:44:06,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-09 05:44:06,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-09 05:44:06,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-09 05:44:06,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-09 05:44:06,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (1/1) ... [2019-09-09 05:44:06,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-09 05:44:06,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-09 05:44:06,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-09 05:44:06,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-09 05:44:06,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (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-09 05:44:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-09 05:44:06,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-09 05:44:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-09 05:44:06,304 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-09 05:44:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-09 05:44:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-09 05:44:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-09 05:44:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-09 05:44:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-09 05:44:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2019-09-09 05:44:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2019-09-09 05:44:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-09 05:44:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-09 05:44:06,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-09 05:44:06,528 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-09 05:44:06,529 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-09 05:44:06,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:06 BoogieIcfgContainer [2019-09-09 05:44:06,532 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-09 05:44:06,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-09 05:44:06,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-09 05:44:06,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-09 05:44:06,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.09 05:44:05" (1/3) ... [2019-09-09 05:44:06,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3867f4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:06, skipping insertion in model container [2019-09-09 05:44:06,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.09 05:44:06" (2/3) ... [2019-09-09 05:44:06,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3867f4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.09 05:44:06, skipping insertion in model container [2019-09-09 05:44:06,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.09 05:44:06" (3/3) ... [2019-09-09 05:44:06,555 INFO L109 eAbstractionObserver]: Analyzing ICFG modulus-2.i [2019-09-09 05:44:06,567 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-09 05:44:06,575 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-09 05:44:06,614 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-09 05:44:06,639 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-09 05:44:06,640 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-09 05:44:06,640 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-09 05:44:06,640 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-09 05:44:06,640 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-09 05:44:06,640 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-09 05:44:06,640 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-09 05:44:06,640 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-09 05:44:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-09 05:44:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-09 05:44:06,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:06,665 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:06,667 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:06,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:06,674 INFO L82 PathProgramCache]: Analyzing trace with hash -990388171, now seen corresponding path program 1 times [2019-09-09 05:44:06,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:06,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:06,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:06,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:06,770 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:06,770 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:06,771 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:06,797 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:06,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:06,829 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-09 05:44:06,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:44:06,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:06,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:06,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:06,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:06,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-09 05:44:06,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:06,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:06,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:06,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:06,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:06,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:06,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:06,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:07,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:09,258 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-09 05:44:09,258 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:09,497 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-09 05:44:09,505 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:09,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-09-09 05:44:09,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:09,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-09 05:44:09,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-09 05:44:09,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-09 05:44:09,535 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2019-09-09 05:44:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:09,720 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-09-09 05:44:09,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-09 05:44:09,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-09-09 05:44:09,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:09,734 INFO L225 Difference]: With dead ends: 36 [2019-09-09 05:44:09,734 INFO L226 Difference]: Without dead ends: 18 [2019-09-09 05:44:09,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-09 05:44:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-09 05:44:09,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-09-09 05:44:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-09 05:44:09,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-09-09 05:44:09,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2019-09-09 05:44:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:09,790 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-09-09 05:44:09,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-09 05:44:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2019-09-09 05:44:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-09 05:44:09,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:09,792 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:09,793 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash -988541129, now seen corresponding path program 1 times [2019-09-09 05:44:09,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:09,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:09,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:09,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:09,816 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:09,816 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:09,816 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:09,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:09,853 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-09 05:44:09,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-09 05:44:09,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:09,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:09,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:09,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:09,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-09 05:44:09,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:10,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:10,200 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-09 05:44:10,200 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:10,450 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-09 05:44:10,454 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:10,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-09-09 05:44:10,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:10,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:44:10,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:44:10,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-09 05:44:10,456 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand 7 states. [2019-09-09 05:44:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:10,519 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-09-09 05:44:10,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:44:10,519 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-09-09 05:44:10,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:10,520 INFO L225 Difference]: With dead ends: 20 [2019-09-09 05:44:10,520 INFO L226 Difference]: Without dead ends: 16 [2019-09-09 05:44:10,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-09-09 05:44:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-09 05:44:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-09 05:44:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-09 05:44:10,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2019-09-09 05:44:10,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2019-09-09 05:44:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:10,525 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2019-09-09 05:44:10,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:44:10,525 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2019-09-09 05:44:10,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-09 05:44:10,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:10,526 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:10,526 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:10,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 370514993, now seen corresponding path program 1 times [2019-09-09 05:44:10,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:10,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:10,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:10,543 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:10,543 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:10,543 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-09 05:44:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:10,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:10,579 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 16 with the following transitions: [2019-09-09 05:44:10,581 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [14], [16], [23], [29], [35], [45], [48], [50], [56], [57], [58], [60] [2019-09-09 05:44:10,637 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:10,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:10,759 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:10,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:10,917 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 18 root evaluator evaluations with a maximum evaluation depth of 13. Performed 18 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2019-09-09 05:44:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:10,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:10,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:10,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:44:10,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:10,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:10,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-09 05:44:10,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:10,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:11,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-09 05:44:11,008 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-09 05:44:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 5 [2019-09-09 05:44:11,008 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:11,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-09 05:44:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-09 05:44:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-09 05:44:11,009 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 4 states. [2019-09-09 05:44:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:11,050 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2019-09-09 05:44:11,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-09 05:44:11,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-09-09 05:44:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:11,052 INFO L225 Difference]: With dead ends: 17 [2019-09-09 05:44:11,052 INFO L226 Difference]: Without dead ends: 17 [2019-09-09 05:44:11,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-09 05:44:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-09 05:44:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-09 05:44:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-09 05:44:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-09-09 05:44:11,055 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2019-09-09 05:44:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:11,056 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-09-09 05:44:11,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-09 05:44:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-09-09 05:44:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-09 05:44:11,057 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:11,057 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:11,057 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:11,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1512958244, now seen corresponding path program 1 times [2019-09-09 05:44:11,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:11,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:11,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:11,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:11,071 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:11,074 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:11,074 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:11,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:11,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:11,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-09 05:44:11,115 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [14], [16], [23], [25], [29], [35], [45], [48], [50], [56], [57], [58], [60] [2019-09-09 05:44:11,117 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:11,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:11,120 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:11,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:11,171 INFO L272 AbstractInterpreter]: Visited 16 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Performed 31 root evaluator evaluations with a maximum evaluation depth of 13. Performed 31 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2019-09-09 05:44:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:11,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:11,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:11,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-09 05:44:11,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:11,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:11,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-09 05:44:11,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:11,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:11,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:11,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:11,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:13,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 05:44:13,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:19,660 WARN L188 SmtUtils]: Spent 6.11 s on a formula simplification. DAG size of input: 40 DAG size of output: 10 [2019-09-09 05:44:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 05:44:23,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:44:23,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-09 05:44:23,109 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:23,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-09 05:44:23,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-09 05:44:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=97, Unknown=3, NotChecked=0, Total=132 [2019-09-09 05:44:23,110 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 7 states. [2019-09-09 05:44:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:23,185 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-09-09 05:44:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-09 05:44:23,185 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-09 05:44:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:23,186 INFO L225 Difference]: With dead ends: 20 [2019-09-09 05:44:23,187 INFO L226 Difference]: Without dead ends: 17 [2019-09-09 05:44:23,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=38, Invalid=115, Unknown=3, NotChecked=0, Total=156 [2019-09-09 05:44:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-09-09 05:44:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-09-09 05:44:23,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-09-09 05:44:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-09-09 05:44:23,191 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2019-09-09 05:44:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:23,191 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-09-09 05:44:23,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-09 05:44:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-09-09 05:44:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-09 05:44:23,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-09 05:44:23,192 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-09 05:44:23,192 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-09 05:44:23,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:23,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1514805286, now seen corresponding path program 1 times [2019-09-09 05:44:23,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-09 05:44:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:23,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-09 05:44:23,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-09 05:44:23,204 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-09 05:44:23,204 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-09 05:44:23,205 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-09 05:44:23,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:23,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-09 05:44:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:23,252 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2019-09-09 05:44:23,253 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [14], [16], [23], [25], [29], [37], [45], [48], [50], [56], [57], [58], [60] [2019-09-09 05:44:23,256 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-09 05:44:23,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-09 05:44:23,258 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-09 05:44:23,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-09 05:44:23,287 INFO L272 AbstractInterpreter]: Visited 16 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Performed 30 root evaluator evaluations with a maximum evaluation depth of 13. Performed 30 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 3 fixpoints after 2 different actions. Largest state had 6 variables. [2019-09-09 05:44:23,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-09 05:44:23,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-09 05:44:23,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-09 05:44:23,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-09 05:44:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-09 05:44:23,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-09 05:44:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-09 05:44:24,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-09 05:44:24,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-09 05:44:24,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-09 05:44:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-09 05:44:24,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-09 05:44:29,170 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 40 DAG size of output: 10 [2019-09-09 05:44:29,662 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~m~0 Int)) (let ((.cse1 (mod c_main_~d~0 4294967296)) (.cse0 (mod main_~m~0 4294967296))) (or (= (mod (mod .cse0 .cse1) 4294967296) .cse0) (< .cse1 .cse0) (= .cse1 .cse0)))) is different from true [2019-09-09 05:44:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2019-09-09 05:44:30,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-09 05:44:30,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2019-09-09 05:44:30,071 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-09 05:44:30,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-09 05:44:30,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-09 05:44:30,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=117, Unknown=1, NotChecked=22, Total=182 [2019-09-09 05:44:30,073 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 8 states. [2019-09-09 05:44:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-09 05:44:30,108 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-09-09 05:44:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-09 05:44:30,108 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-09-09 05:44:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-09 05:44:30,108 INFO L225 Difference]: With dead ends: 15 [2019-09-09 05:44:30,109 INFO L226 Difference]: Without dead ends: 0 [2019-09-09 05:44:30,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=48, Invalid=137, Unknown=1, NotChecked=24, Total=210 [2019-09-09 05:44:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-09 05:44:30,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-09 05:44:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-09 05:44:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-09 05:44:30,110 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2019-09-09 05:44:30,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-09 05:44:30,111 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-09 05:44:30,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-09 05:44:30,111 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-09 05:44:30,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-09 05:44:30,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.09 05:44:30 BoogieIcfgContainer [2019-09-09 05:44:30,116 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-09 05:44:30,118 INFO L168 Benchmark]: Toolchain (without parser) took 24300.09 ms. Allocated memory was 141.0 MB in the beginning and 254.8 MB in the end (delta: 113.8 MB). Free memory was 89.2 MB in the beginning and 158.8 MB in the end (delta: -69.6 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:30,119 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-09 05:44:30,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.84 ms. Allocated memory is still 141.0 MB. Free memory was 89.0 MB in the beginning and 79.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:30,121 INFO L168 Benchmark]: Boogie Preprocessor took 133.23 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 79.0 MB in the beginning and 177.5 MB in the end (delta: -98.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:30,121 INFO L168 Benchmark]: RCFGBuilder took 289.41 ms. Allocated memory is still 200.8 MB. Free memory was 177.5 MB in the beginning and 164.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:30,122 INFO L168 Benchmark]: TraceAbstraction took 23583.63 ms. Allocated memory was 200.8 MB in the beginning and 254.8 MB in the end (delta: 54.0 MB). Free memory was 164.6 MB in the beginning and 158.8 MB in the end (delta: 5.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. [2019-09-09 05:44:30,126 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.84 ms. Allocated memory is still 141.0 MB. Free memory was 89.0 MB in the beginning and 79.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.23 ms. Allocated memory was 141.0 MB in the beginning and 200.8 MB in the end (delta: 59.8 MB). Free memory was 79.0 MB in the beginning and 177.5 MB in the end (delta: -98.5 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 289.41 ms. Allocated memory is still 200.8 MB. Free memory was 177.5 MB in the beginning and 164.6 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23583.63 ms. Allocated memory was 200.8 MB in the beginning and 254.8 MB in the end (delta: 54.0 MB). Free memory was 164.6 MB in the beginning and 158.8 MB in the end (delta: 5.9 MB). Peak memory consumption was 59.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 23.4s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75 SDtfs, 30 SDslu, 203 SDs, 0 SdLazy, 138 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.8s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 132 ConstructedInterpolants, 9 QuantifiedInterpolants, 10656 SizeOfPredicates, 22 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 8/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...