/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks NOT_INCREMENTALLY -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-20 12:14:50,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 12:14:50,684 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 12:14:50,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 12:14:50,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 12:14:50,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 12:14:50,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 12:14:50,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 12:14:50,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 12:14:50,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 12:14:50,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 12:14:50,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 12:14:50,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 12:14:50,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 12:14:50,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 12:14:50,712 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 12:14:50,713 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 12:14:50,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 12:14:50,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 12:14:50,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 12:14:50,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 12:14:50,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 12:14:50,721 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 12:14:50,722 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 12:14:50,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 12:14:50,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 12:14:50,725 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 12:14:50,726 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 12:14:50,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 12:14:50,727 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 12:14:50,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 12:14:50,728 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 12:14:50,729 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 12:14:50,730 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 12:14:50,731 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 12:14:50,731 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 12:14:50,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 12:14:50,732 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 12:14:50,732 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 12:14:50,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 12:14:50,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 12:14:50,735 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 [2020-07-20 12:14:50,757 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 12:14:50,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 12:14:50,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 12:14:50,759 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 12:14:50,759 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 12:14:50,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 12:14:50,760 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 12:14:50,760 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 12:14:50,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 12:14:50,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 12:14:50,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 12:14:50,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 12:14:50,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 12:14:50,761 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 12:14:50,761 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 12:14:50,762 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 12:14:50,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 12:14:50,762 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 12:14:50,762 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 12:14:50,762 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 12:14:50,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 12:14:50,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 12:14:50,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 12:14:50,763 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 12:14:50,763 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 12:14:50,764 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 12:14:50,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:14:50,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 12:14:50,764 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 12:14:50,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> NOT_INCREMENTALLY [2020-07-20 12:14:51,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 12:14:51,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 12:14:51,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 12:14:51,147 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 12:14:51,148 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 12:14:51,149 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt3.c [2020-07-20 12:14:51,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6448ea89/ebf8eabdfcd24dd2b7020b8329b6e87e/FLAG63fd55ef9 [2020-07-20 12:14:51,726 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 12:14:51,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt3.c [2020-07-20 12:14:51,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6448ea89/ebf8eabdfcd24dd2b7020b8329b6e87e/FLAG63fd55ef9 [2020-07-20 12:14:52,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6448ea89/ebf8eabdfcd24dd2b7020b8329b6e87e [2020-07-20 12:14:52,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 12:14:52,116 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 12:14:52,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 12:14:52,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 12:14:52,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 12:14:52,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2573e66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52, skipping insertion in model container [2020-07-20 12:14:52,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,135 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 12:14:52,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 12:14:52,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:14:52,349 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 12:14:52,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 12:14:52,388 INFO L208 MainTranslator]: Completed translation [2020-07-20 12:14:52,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52 WrapperNode [2020-07-20 12:14:52,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 12:14:52,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 12:14:52,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 12:14:52,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 12:14:52,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,531 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (1/1) ... [2020-07-20 12:14:52,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 12:14:52,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 12:14:52,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 12:14:52,558 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 12:14:52,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (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 [2020-07-20 12:14:52,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 12:14:52,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 12:14:52,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-20 12:14:52,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-20 12:14:52,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 12:14:52,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 12:14:52,667 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 12:14:52,669 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-20 12:14:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-20 12:14:52,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 12:14:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 12:14:52,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 12:14:52,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 12:14:52,925 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 12:14:52,926 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-20 12:14:52,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:14:52 BoogieIcfgContainer [2020-07-20 12:14:52,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 12:14:52,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 12:14:52,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 12:14:52,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 12:14:52,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:14:52" (1/3) ... [2020-07-20 12:14:52,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:14:52, skipping insertion in model container [2020-07-20 12:14:52,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:14:52" (2/3) ... [2020-07-20 12:14:52,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2220e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:14:52, skipping insertion in model container [2020-07-20 12:14:52,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:14:52" (3/3) ... [2020-07-20 12:14:52,941 INFO L109 eAbstractionObserver]: Analyzing ICFG sumt3.c [2020-07-20 12:14:52,954 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 12:14:52,965 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 12:14:52,985 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 12:14:53,026 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 12:14:53,026 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 12:14:53,027 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 12:14:53,027 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 12:14:53,027 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 12:14:53,027 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 12:14:53,028 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 12:14:53,028 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 12:14:53,082 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-07-20 12:14:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-20 12:14:53,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:14:53,103 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:14:53,107 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:14:53,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:14:53,126 INFO L82 PathProgramCache]: Analyzing trace with hash -320041890, now seen corresponding path program 1 times [2020-07-20 12:14:53,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:14:53,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1275384054] [2020-07-20 12:14:53,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:14:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:14:53,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-20 12:14:53,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:14:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:14:53,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:14:53,320 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1275384054] [2020-07-20 12:14:53,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:14:53,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-20 12:14:53,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333452302] [2020-07-20 12:14:53,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-20 12:14:53,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:14:53,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-20 12:14:53,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 12:14:53,343 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2020-07-20 12:14:53,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:14:53,367 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-07-20 12:14:53,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-20 12:14:53,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-07-20 12:14:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:14:53,380 INFO L225 Difference]: With dead ends: 35 [2020-07-20 12:14:53,381 INFO L226 Difference]: Without dead ends: 16 [2020-07-20 12:14:53,385 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-20 12:14:53,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-20 12:14:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-20 12:14:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-20 12:14:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-20 12:14:53,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2020-07-20 12:14:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:14:53,435 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-20 12:14:53,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-20 12:14:53,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-20 12:14:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-20 12:14:53,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:14:53,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:14:53,650 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:14:53,651 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:14:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:14:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash -334818226, now seen corresponding path program 1 times [2020-07-20 12:14:53,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:14:53,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284047968] [2020-07-20 12:14:53,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:14:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:14:53,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-20 12:14:53,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:14:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:14:53,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 12:14:53,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284047968] [2020-07-20 12:14:53,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 12:14:53,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 12:14:53,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272324836] [2020-07-20 12:14:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 12:14:53,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:14:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 12:14:53,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 12:14:53,799 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2020-07-20 12:14:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:14:53,883 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2020-07-20 12:14:53,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 12:14:53,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-20 12:14:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:14:53,887 INFO L225 Difference]: With dead ends: 30 [2020-07-20 12:14:53,888 INFO L226 Difference]: Without dead ends: 18 [2020-07-20 12:14:53,889 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-20 12:14:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-20 12:14:53,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-20 12:14:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-20 12:14:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-20 12:14:53,897 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2020-07-20 12:14:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:14:53,898 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-20 12:14:53,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 12:14:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-20 12:14:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-20 12:14:53,899 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:14:53,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:14:54,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:14:54,116 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:14:54,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:14:54,118 INFO L82 PathProgramCache]: Analyzing trace with hash -135124987, now seen corresponding path program 1 times [2020-07-20 12:14:54,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:14:54,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440305816] [2020-07-20 12:14:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:14:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:14:54,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-20 12:14:54,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:14:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:14:54,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:14:54,425 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 12:14:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:14:54,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440305816] [2020-07-20 12:14:54,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 12:14:54,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2020-07-20 12:14:54,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317432003] [2020-07-20 12:14:54,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-20 12:14:54,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:14:54,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-20 12:14:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-20 12:14:54,728 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 14 states. [2020-07-20 12:15:01,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:15:01,219 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-20 12:15:01,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-20 12:15:01,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2020-07-20 12:15:01,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:15:01,221 INFO L225 Difference]: With dead ends: 37 [2020-07-20 12:15:01,221 INFO L226 Difference]: Without dead ends: 24 [2020-07-20 12:15:01,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-07-20 12:15:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-20 12:15:01,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-20 12:15:01,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-20 12:15:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-20 12:15:01,229 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2020-07-20 12:15:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:15:01,230 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-20 12:15:01,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-20 12:15:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-20 12:15:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-20 12:15:01,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:15:01,232 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:15:01,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:15:01,447 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:15:01,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:15:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash 498025845, now seen corresponding path program 1 times [2020-07-20 12:15:01,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:15:01,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1981064264] [2020-07-20 12:15:01,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:15:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:15:01,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-20 12:15:01,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:15:01,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:15:01,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:15:01,866 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 12:15:08,421 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_main_~l~0 2)) (.cse0 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse1 (mod c_main_~l~0 4294967296))) (or (and (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (or .cse0 (<= 0 .cse1))) (= (mod .cse2 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296)) (< (mod .cse2 4294967296) (mod c_main_~n~0 4294967296)) (and (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296)) (not .cse0) (< .cse1 0)))) is different from true [2020-07-20 12:15:31,499 WARN L193 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2020-07-20 12:15:41,963 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-20 12:15:56,576 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-20 12:15:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 2 not checked. [2020-07-20 12:15:56,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1981064264] [2020-07-20 12:15:56,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 12:15:56,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2020-07-20 12:15:56,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652537831] [2020-07-20 12:15:56,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-20 12:15:56,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:15:56,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-20 12:15:56,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=352, Unknown=19, NotChecked=40, Total=506 [2020-07-20 12:15:56,598 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2020-07-20 12:15:58,798 WARN L860 $PredicateComparison]: unable to prove that (and (= 0 c_main_~k~0) (= 1 c_main_~l~0) (= 1 c_main_~i~0) (let ((.cse2 (+ c_main_~l~0 2)) (.cse0 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse1 (mod c_main_~l~0 4294967296))) (or (and (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (or .cse0 (<= 0 .cse1))) (= (mod .cse2 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296)) (< (mod .cse2 4294967296) (mod c_main_~n~0 4294967296)) (and (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296)) (not .cse0) (< .cse1 0)))) (= 0 c_main_~j~0) (< (mod c_main_~l~0 4294967296) (mod c_main_~n~0 4294967296))) is different from true [2020-07-20 12:16:32,335 WARN L193 SmtUtils]: Spent 27.09 s on a formula simplification. DAG size of input: 65 DAG size of output: 54 [2020-07-20 12:16:38,593 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~n~0 4294967296))) (and (let ((.cse0 (+ c_main_~l~0 1))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse0 4294967296) .cse1))) (or (< (mod c_main_~l~0 4294967296) .cse1) (= (mod c_main_~l~0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296))) (or (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (= (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296))))))) is different from false [2020-07-20 12:16:40,668 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_main_~n~0 4294967296))) (and (let ((.cse2 (+ c_main_~l~0 2)) (.cse0 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse1 (mod c_main_~l~0 4294967296))) (or (and (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (or .cse0 (<= 0 .cse1))) (= (mod .cse2 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296)) (< (mod .cse2 4294967296) .cse3) (and (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296)) (not .cse0) (< .cse1 0)))) (let ((.cse4 (+ c_main_~l~0 1))) (or (= (mod .cse4 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse4 4294967296) .cse3))))) is different from true [2020-07-20 12:17:35,099 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse0 (+ c_main_~l~0 1))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296)))) (or (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (= (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296) (mod (+ c_main_~l~0 2) 4294967296)) (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296)))))) is different from true [2020-07-20 12:18:00,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:18:00,123 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2020-07-20 12:18:00,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-20 12:18:00,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2020-07-20 12:18:00,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:18:00,124 INFO L225 Difference]: With dead ends: 50 [2020-07-20 12:18:00,125 INFO L226 Difference]: Without dead ends: 38 [2020-07-20 12:18:00,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 103.2s TimeCoverageRelationStatistics Valid=124, Invalid=468, Unknown=28, NotChecked=250, Total=870 [2020-07-20 12:18:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-20 12:18:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-20 12:18:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-20 12:18:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2020-07-20 12:18:00,138 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 22 [2020-07-20 12:18:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:18:00,139 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2020-07-20 12:18:00,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-20 12:18:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2020-07-20 12:18:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-20 12:18:00,140 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:18:00,140 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:18:00,341 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:18:00,342 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:18:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:18:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1585782028, now seen corresponding path program 1 times [2020-07-20 12:18:00,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:18:00,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [965433969] [2020-07-20 12:18:00,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:18:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:18:00,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 30 conjunts are in the unsatisfiable core [2020-07-20 12:18:00,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:18:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:18:00,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:18:00,554 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 12:18:04,889 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 1)) (.cse1 (mod c_main_~l~0 4294967296)) (.cse2 (= 0 (mod (mod c_main_~l~0 4294967296) 3)))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296)) (and (< .cse1 0) (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296)) (not .cse2)) (and (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (or (<= 0 .cse1) .cse2)))) is different from true [2020-07-20 12:18:07,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_main_~l~0 4294967296))) (let ((.cse1 (<= 0 .cse7)) (.cse5 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse0 (< .cse7 0)) (.cse2 (= (mod (+ c_main_~l~0 1) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296))) (.cse3 (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296))))) (.cse6 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 .cse3 .cse6) (or .cse1 .cse2 .cse5 .cse3 .cse4) (or .cse2 .cse3 (not .cse4) .cse6) (or .cse0 .cse2 .cse3 .cse6)))) is different from false [2020-07-20 12:18:23,898 WARN L193 SmtUtils]: Spent 6.32 s on a formula simplification. DAG size of input: 86 DAG size of output: 36 [2020-07-20 12:18:32,273 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-20 12:18:42,752 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-20 12:18:59,447 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-20 12:19:07,877 WARN L193 SmtUtils]: Spent 4.19 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-20 12:19:32,852 WARN L193 SmtUtils]: Spent 4.17 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-20 12:19:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 5 times theorem prover too weak. 0 trivial. 7 not checked. [2020-07-20 12:19:32,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [965433969] [2020-07-20 12:19:32,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 12:19:32,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 24 [2020-07-20 12:19:32,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368935340] [2020-07-20 12:19:32,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-20 12:19:32,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:19:32,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-20 12:19:32,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=344, Unknown=29, NotChecked=82, Total=552 [2020-07-20 12:19:32,873 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 24 states. [2020-07-20 12:19:49,622 WARN L193 SmtUtils]: Spent 8.36 s on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-07-20 12:22:52,269 WARN L193 SmtUtils]: Spent 2.72 m on a formula simplification. DAG size of input: 107 DAG size of output: 73 [2020-07-20 12:23:07,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (+ c_main_~l~0 1)) (.cse9 (mod c_main_~l~0 4294967296))) (let ((.cse5 (+ c_main_~l~0 2)) (.cse1 (<= 0 .cse9)) (.cse6 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse0 (< .cse9 0)) (.cse2 (= (mod .cse8 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296))) (.cse3 (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296))))) (.cse7 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 2) 4294967296)))) (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 3) 4294967296)) (= (mod (mod (mod .cse5 4294967296) 3) 4294967296) 0)) (or .cse2 .cse6 .cse3 .cse7) (or (= (mod c_main_~l~0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296)) (< (mod c_main_~l~0 4294967296) (mod c_main_~n~0 4294967296))) (or (= (mod (mod (mod .cse8 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod .cse5 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296))) (or .cse1 .cse2 .cse6 .cse3 .cse4) (or .cse2 .cse3 (not .cse4) .cse7) (or .cse0 .cse2 .cse3 .cse7)))) is different from false [2020-07-20 12:23:09,355 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 2)) (.cse1 (+ c_main_~l~0 1))) (and (or (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 2) 4294967296)))) (= (mod (+ c_main_~l~0 3) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 3) 4294967296)) (= (mod (mod (mod .cse0 4294967296) 3) 4294967296) 0)) (or (= (mod (mod (mod .cse1 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296))) (let ((.cse2 (mod c_main_~l~0 4294967296)) (.cse3 (= 0 (mod (mod c_main_~l~0 4294967296) 3)))) (or (= (mod .cse1 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse1 4294967296) (mod c_main_~n~0 4294967296)) (and (< .cse2 0) (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296)) (not .cse3)) (and (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (or (<= 0 .cse2) .cse3)))))) is different from false [2020-07-20 12:24:00,797 WARN L193 SmtUtils]: Spent 27.93 s on a formula simplification that was a NOOP. DAG size: 72 [2020-07-20 12:24:05,039 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 1)) (.cse1 (+ c_main_~l~0 2))) (and (or (= (mod (mod (mod .cse0 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod .cse1 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296))) (or (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 3) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 2) 4294967296)))) (= (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296) (mod (+ c_main_~l~0 3) 4294967296)) (= (mod (mod (mod .cse1 4294967296) 3) 4294967296) 0)))) is different from false [2020-07-20 12:24:24,365 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (+ c_main_~l~0 1)) (.cse8 (mod c_main_~l~0 4294967296))) (let ((.cse1 (<= 0 .cse8)) (.cse5 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse0 (< .cse8 0)) (.cse2 (= (mod .cse7 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296))) (.cse3 (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296))))) (.cse6 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 .cse3 .cse6) (or (= (mod c_main_~l~0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296)) (< (mod c_main_~l~0 4294967296) (mod c_main_~n~0 4294967296))) (or (= (mod (mod (mod .cse7 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod (+ c_main_~l~0 2) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296))) (or .cse1 .cse2 .cse5 .cse3 .cse4) (or .cse2 .cse3 (not .cse4) .cse6) (or .cse0 .cse2 .cse3 .cse6)))) is different from false [2020-07-20 12:24:39,296 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_main_~l~0 1)) (.cse0 (mod c_main_~n~0 4294967296))) (and (or (= (mod c_main_~l~0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296)) (< (mod c_main_~l~0 4294967296) .cse0)) (or (= (mod (mod (mod .cse1 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod (+ c_main_~l~0 2) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296))) (let ((.cse2 (mod c_main_~l~0 4294967296)) (.cse3 (= 0 (mod (mod c_main_~l~0 4294967296) 3)))) (or (= (mod .cse1 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse1 4294967296) .cse0) (and (< .cse2 0) (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296)) (not .cse3)) (and (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)) (or (<= 0 .cse2) .cse3)))))) is different from true [2020-07-20 12:24:43,644 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 1))) (and (or (= (mod (mod (mod .cse0 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod (+ c_main_~l~0 2) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296))))) is different from false [2020-07-20 12:24:45,821 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_main_~l~0 1))) (and (or (= (mod (mod (mod .cse0 4294967296) 3) 4294967296) 0) (forall ((v_prenex_4 Int)) (or (< (mod (+ c_main_~l~0 2) 4294967296) (mod v_prenex_4 4294967296)) (<= (mod v_prenex_4 4294967296) (mod (+ c_main_~l~0 1) 4294967296)))) (= (mod (+ c_main_~l~0 2) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 2) 4294967296))) (or (= (mod .cse0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296)) (< (mod .cse0 4294967296) (mod c_main_~n~0 4294967296))))) is different from true [2020-07-20 12:25:03,133 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 50 [2020-07-20 12:25:11,692 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_main_~l~0 4294967296))) (let ((.cse1 (<= 0 .cse7)) (.cse5 (= 0 (mod (+ (mod (mod c_main_~l~0 4294967296) 3) 4294967293) 4294967296))) (.cse4 (= 0 (mod (mod c_main_~l~0 4294967296) 3))) (.cse0 (< .cse7 0)) (.cse2 (= (mod (+ c_main_~l~0 1) 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0 1) 4294967296))) (.cse3 (forall ((main_~n~0 Int)) (or (< (mod (+ c_main_~l~0 1) 4294967296) (mod main_~n~0 4294967296)) (<= (mod main_~n~0 4294967296) (mod c_main_~l~0 4294967296))))) (.cse6 (= 0 (mod (mod (mod c_main_~l~0 4294967296) 3) 4294967296)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse2 .cse5 .cse3 .cse6) (or (= (mod c_main_~l~0 4294967296) (mod (+ c_main_~j~0 c_main_~k~0 c_main_~i~0) 4294967296)) (< (mod c_main_~l~0 4294967296) (mod c_main_~n~0 4294967296))) (or .cse1 .cse2 .cse5 .cse3 .cse4) (or .cse2 .cse3 (not .cse4) .cse6) (or .cse0 .cse2 .cse3 .cse6)))) is different from false [2020-07-20 12:25:44,326 WARN L193 SmtUtils]: Spent 17.47 s on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-07-20 12:26:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 12:26:35,898 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2020-07-20 12:26:35,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-07-20 12:26:35,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2020-07-20 12:26:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 12:26:35,900 INFO L225 Difference]: With dead ends: 62 [2020-07-20 12:26:35,900 INFO L226 Difference]: Without dead ends: 43 [2020-07-20 12:26:35,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 425.4s TimeCoverageRelationStatistics Valid=168, Invalid=602, Unknown=78, NotChecked=558, Total=1406 [2020-07-20 12:26:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-20 12:26:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-20 12:26:35,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-20 12:26:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2020-07-20 12:26:35,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 27 [2020-07-20 12:26:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 12:26:35,911 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2020-07-20 12:26:35,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-20 12:26:35,911 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-20 12:26:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-20 12:26:35,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 12:26:35,912 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 12:26:36,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:36,113 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 12:26:36,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 12:26:36,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1031065109, now seen corresponding path program 2 times [2020-07-20 12:26:36,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 12:26:36,115 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [989412111] [2020-07-20 12:26:36,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 12:26:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 12:26:36,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 12:26:36,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 12:26:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:26:36,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 12:26:36,586 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 12:27:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 12:27:08,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [989412111] [2020-07-20 12:27:08,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 12:27:08,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2020-07-20 12:27:08,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149535073] [2020-07-20 12:27:08,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-20 12:27:08,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 12:27:08,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-20 12:27:08,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=705, Unknown=14, NotChecked=0, Total=870 [2020-07-20 12:27:08,277 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 30 states. [2020-07-20 12:27:52,282 WARN L193 SmtUtils]: Spent 42.86 s on a formula simplification. DAG size of input: 97 DAG size of output: 20 [2020-07-20 12:28:30,748 WARN L193 SmtUtils]: Spent 27.81 s on a formula simplification. DAG size of input: 89 DAG size of output: 21 [2020-07-20 12:29:05,596 WARN L193 SmtUtils]: Spent 23.95 s on a formula simplification. DAG size of input: 73 DAG size of output: 23 [2020-07-20 12:29:30,905 WARN L193 SmtUtils]: Spent 16.66 s on a formula simplification. DAG size of input: 106 DAG size of output: 12