/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:59:19,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:59:19,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:59:19,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:59:19,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:59:19,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:59:19,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:59:19,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:59:19,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:59:19,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:59:19,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:59:19,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:59:19,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:59:19,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:59:19,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:59:19,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:59:19,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:59:19,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:59:19,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:59:19,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:59:19,403 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:59:19,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:59:19,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:59:19,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:59:19,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:59:19,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:59:19,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:59:19,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:59:19,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:59:19,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:59:19,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:59:19,413 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:59:19,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:59:19,415 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:59:19,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:59:19,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:59:19,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:59:19,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:59:19,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:59:19,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:59:19,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:59:19,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:59:19,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:59:19,427 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:59:19,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:59:19,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:59:19,429 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:59:19,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:59:19,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:59:19,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:59:19,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:59:19,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:59:19,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:59:19,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:59:19,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:59:19,431 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:59:19,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:59:19,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:59:19,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:59:19,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:59:19,649 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:59:19,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-28 03:59:19,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea143bc0/868a8e84770545819ee982e7ad061734/FLAGa1bf04fcb [2022-04-28 03:59:20,044 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:59:20,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c [2022-04-28 03:59:20,049 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea143bc0/868a8e84770545819ee982e7ad061734/FLAGa1bf04fcb [2022-04-28 03:59:20,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea143bc0/868a8e84770545819ee982e7ad061734 [2022-04-28 03:59:20,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:59:20,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:59:20,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:59:20,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:59:20,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:59:20,068 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,069 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ac1e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20, skipping insertion in model container [2022-04-28 03:59:20,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,074 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:59:20,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:59:20,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c[403,416] [2022-04-28 03:59:20,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:59:20,296 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:59:20,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt5.c[403,416] [2022-04-28 03:59:20,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:59:20,335 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:59:20,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20 WrapperNode [2022-04-28 03:59:20,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:59:20,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:59:20,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:59:20,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:59:20,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,348 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,348 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,370 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:59:20,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:59:20,371 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:59:20,371 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:59:20,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (1/1) ... [2022-04-28 03:59:20,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:59:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:20,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:59:20,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:59:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:59:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:59:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:59:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 03:59:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:59:20,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:59:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:59:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:59:20,453 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:59:20,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:59:20,495 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:59:20,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:59:25,057 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:59:25,062 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:59:25,063 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:59:25,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:59:25 BoogieIcfgContainer [2022-04-28 03:59:25,077 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:59:25,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:59:25,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:59:25,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:59:25,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:59:20" (1/3) ... [2022-04-28 03:59:25,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7413919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:59:25, skipping insertion in model container [2022-04-28 03:59:25,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:59:20" (2/3) ... [2022-04-28 03:59:25,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7413919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:59:25, skipping insertion in model container [2022-04-28 03:59:25,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:59:25" (3/3) ... [2022-04-28 03:59:25,093 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt5.c [2022-04-28 03:59:25,102 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:59:25,103 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:59:25,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:59:25,141 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73483b49, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2bd92c42 [2022-04-28 03:59:25,141 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:59:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:59:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:59:25,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:25,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:25,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:25,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:25,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 1 times [2022-04-28 03:59:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:25,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335049344] [2022-04-28 03:59:25,185 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:59:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1530412705, now seen corresponding path program 2 times [2022-04-28 03:59:25,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:25,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025335158] [2022-04-28 03:59:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:25,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:25,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:25,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {28#true} is VALID [2022-04-28 03:59:25,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:59:25,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-28 03:59:25,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:25,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {28#true} is VALID [2022-04-28 03:59:25,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-28 03:59:25,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #71#return; {28#true} is VALID [2022-04-28 03:59:25,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-28 03:59:25,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 03:59:25,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 03:59:25,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 03:59:25,694 INFO L272 TraceCheckUtils]: 8: Hoare triple {33#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {34#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:59:25,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {35#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:59:25,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29#false} is VALID [2022-04-28 03:59:25,695 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-28 03:59:25,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:25,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:25,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025335158] [2022-04-28 03:59:25,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025335158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:25,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:25,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:59:25,700 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:25,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335049344] [2022-04-28 03:59:25,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335049344] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:25,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:25,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:59:25,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587571106] [2022-04-28 03:59:25,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:59:25,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:25,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:25,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:25,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:59:25,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:25,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:59:25,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:59:25,747 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:27,959 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:59:32,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:59:36,701 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:59:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:37,054 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-28 03:59:37,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:59:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:59:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-28 03:59:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-04-28 03:59:37,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-04-28 03:59:37,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:37,196 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:59:37,196 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:59:37,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:59:37,202 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 35 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:37,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 46 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 6.4s Time] [2022-04-28 03:59:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:59:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-28 03:59:37,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:37,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,236 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,237 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:37,239 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-28 03:59:37,239 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-28 03:59:37,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:37,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:37,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:59:37,240 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:59:37,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:37,242 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-28 03:59:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-28 03:59:37,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:37,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:37,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:37,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-04-28 03:59:37,254 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-04-28 03:59:37,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:37,259 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-04-28 03:59:37,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:37,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 23 transitions. [2022-04-28 03:59:37,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-04-28 03:59:37,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:59:37,319 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:37,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:37,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:59:37,320 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:37,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1637920365, now seen corresponding path program 1 times [2022-04-28 03:59:37,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:37,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564925850] [2022-04-28 04:01:06,848 WARN L232 SmtUtils]: Spent 1.24m on a formula simplification. DAG size of input: 76 DAG size of output: 64 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:01:11,166 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:01:15,586 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:01:17,766 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:02:38,509 WARN L232 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 76 DAG size of output: 30 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:02:38,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:02:38,518 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:02:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1749993697, now seen corresponding path program 1 times [2022-04-28 04:02:38,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:02:38,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886277649] [2022-04-28 04:02:38,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:02:38,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:02:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:02:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:02:39,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-28 04:02:39,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-28 04:02:39,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-28 04:02:39,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {219#true} call ULTIMATE.init(); {229#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:02:39,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {219#true} is VALID [2022-04-28 04:02:39,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {219#true} assume true; {219#true} is VALID [2022-04-28 04:02:39,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {219#true} {219#true} #71#return; {219#true} is VALID [2022-04-28 04:02:39,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret5 := main(); {219#true} is VALID [2022-04-28 04:02:39,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {219#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:02:39,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:02:39,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [75] L21-2-->L21-3_primed: Formula: (let ((.cse4 (mod v_main_~l~0_17 4294967296))) (let ((.cse0 (< .cse4 (mod v_main_~n~0_7 4294967296))) (.cse1 (= (mod (mod .cse4 5) 4294967296) 0)) (.cse2 (= v_main_~l~0_17 v_main_~l~0_16)) (.cse3 (= v_main_~v3~0_7 v_main_~v3~0_6))) (or (and (or (not .cse0) (not .cse1)) .cse2 .cse3) (and .cse0 (< v_main_~l~0_16 (+ v_main_~l~0_17 2)) .cse1 (< v_main_~l~0_17 v_main_~l~0_16) (= (+ v_main_~l~0_16 v_main_~v3~0_7) (+ v_main_~l~0_17 v_main_~v3~0_6))) (and .cse2 .cse3 (= v_main_~n~0_7 v_main_~n~0_7))))) InVars {main_~l~0=v_main_~l~0_17, main_~v3~0=v_main_~v3~0_7, main_~n~0=v_main_~n~0_7} OutVars{main_~l~0=v_main_~l~0_16, main_~v3~0=v_main_~v3~0_6, main_~n~0=v_main_~n~0_7} AuxVars[] AssignedVars[main_~l~0, main_~v3~0] {225#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (or (<= main_~v3~0 main_~l~0) (not (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0))))) (and (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~v3~0 0))))} is VALID [2022-04-28 04:02:39,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {225#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (or (<= main_~v3~0 main_~l~0) (not (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0))))) (and (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~v3~0 0))))} [74] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {226#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~v3~0 0)) (and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)))) (= main_~i~0 0) (= main_~v4~0 0))} is VALID [2022-04-28 04:02:39,290 INFO L272 TraceCheckUtils]: 9: Hoare triple {226#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (= main_~v3~0 0)) (and (<= (div main_~l~0 4294967296) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296)) (<= (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0)) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0 1)))) (= main_~i~0 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {227#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:02:39,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {228#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:02:39,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {228#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {220#false} is VALID [2022-04-28 04:02:39,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {220#false} assume !false; {220#false} is VALID [2022-04-28 04:02:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:02:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:02:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886277649] [2022-04-28 04:02:39,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886277649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:39,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:39,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:02:54,661 WARN L232 SmtUtils]: Spent 12.98s on a formula simplification. DAG size of input: 32 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 04:02:54,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:02:54,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564925850] [2022-04-28 04:02:54,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564925850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:02:54,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:02:54,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:02:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993760211] [2022-04-28 04:02:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:02:54,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:02:54,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:02:54,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:54,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:02:54,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:02:54,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:02:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:02:54,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=98, Unknown=1, NotChecked=0, Total=132 [2022-04-28 04:02:54,745 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:02:57,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:01,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:03,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:06,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:08,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:10,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:12,809 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:15,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:03:15,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:15,457 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 04:03:15,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:03:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 04:03:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:03:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 04:03:15,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-28 04:03:15,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-28 04:03:15,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:15,501 INFO L225 Difference]: With dead ends: 37 [2022-04-28 04:03:15,501 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:03:15,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=79, Invalid=262, Unknown=1, NotChecked=0, Total=342 [2022-04-28 04:03:15,502 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:03:15,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 8 Unknown, 0 Unchecked, 17.3s Time] [2022-04-28 04:03:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:03:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:03:15,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:03:15,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,515 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,515 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:15,516 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 04:03:15,516 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:03:15,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:15,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:15,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 04:03:15,517 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 04:03:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:03:15,518 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-28 04:03:15,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:03:15,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:03:15,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:03:15,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:03:15,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:03:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-28 04:03:15,519 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 15 [2022-04-28 04:03:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:03:15,520 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-28 04:03:15,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:03:15,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-28 04:03:15,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:03:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-28 04:03:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:03:15,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:03:15,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:03:15,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:03:15,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:03:15,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:03:15,559 INFO L85 PathProgramCache]: Analyzing trace with hash -469553554, now seen corresponding path program 1 times [2022-04-28 04:03:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:03:15,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1738387517] [2022-04-28 04:05:47,514 WARN L232 SmtUtils]: Spent 2.30m on a formula simplification. DAG size of input: 76 DAG size of output: 71 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:05:51,946 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:05:56,198 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:05:58,410 WARN L1034 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains relation itself. [2022-04-28 04:06:02,856 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:08:47,466 WARN L232 SmtUtils]: Spent 2.48m on a formula simplification. DAG size of input: 76 DAG size of output: 34 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:08:47,474 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:47,475 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1809099041, now seen corresponding path program 1 times [2022-04-28 04:08:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:47,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499732465] [2022-04-28 04:08:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:47,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:47,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {426#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {416#true} is VALID [2022-04-28 04:08:47,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-28 04:08:47,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {416#true} {416#true} #71#return; {416#true} is VALID [2022-04-28 04:08:47,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {426#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:47,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {426#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {416#true} is VALID [2022-04-28 04:08:47,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-28 04:08:47,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #71#return; {416#true} is VALID [2022-04-28 04:08:47,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret5 := main(); {416#true} is VALID [2022-04-28 04:08:47,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {421#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:08:47,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {421#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {421#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:08:47,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [77] L21-2-->L21-3_primed: Formula: (let ((.cse5 (mod v_main_~l~0_24 4294967296))) (let ((.cse0 (= v_main_~v4~0_7 v_main_~v4~0_6)) (.cse1 (= v_main_~l~0_24 v_main_~l~0_23)) (.cse3 (= (mod v_main_~l~0_24 4) 0)) (.cse4 (= (mod (mod .cse5 5) 4294967296) 0)) (.cse2 (< .cse5 (mod v_main_~n~0_9 4294967296)))) (or (and .cse0 .cse1 (= v_main_~n~0_9 v_main_~n~0_9)) (and .cse0 .cse1 (or (not .cse2) (not .cse3) .cse4)) (and (< v_main_~l~0_23 (+ v_main_~l~0_24 2)) (< v_main_~l~0_24 v_main_~l~0_23) (= (+ v_main_~l~0_24 v_main_~v4~0_6) (+ v_main_~l~0_23 v_main_~v4~0_7)) .cse3 (not .cse4) .cse2)))) InVars {main_~l~0=v_main_~l~0_24, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_7} OutVars{main_~l~0=v_main_~l~0_23, main_~n~0=v_main_~n~0_9, main_~v4~0=v_main_~v4~0_6} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {422#(and (= main_~k~0 0) (or (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0)) (<= main_~v4~0 main_~l~0)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:08:47,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (= main_~k~0 0) (or (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 main_~v4~0)) (<= main_~v4~0 main_~l~0)) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))))) (= main_~j~0 0) (= main_~i~0 0) (= main_~v3~0 0))} [76] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_10 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_10, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {423#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))) (= main_~i~0 0) (= main_~v3~0 0))} is VALID [2022-04-28 04:08:47,972 INFO L272 TraceCheckUtils]: 9: Hoare triple {423#(and (= main_~k~0 0) (= main_~j~0 0) (or (and (< (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0 1)) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0))) (and (= main_~l~0 0) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v4~0) (+ (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v4~0) 4294967296) 4294967296) main_~l~0)))) (= main_~i~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {424#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:08:47,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {425#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:08:47,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {425#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {417#false} is VALID [2022-04-28 04:08:47,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-28 04:08:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:47,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:47,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499732465] [2022-04-28 04:08:47,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499732465] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:47,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:47,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:08:48,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:48,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1738387517] [2022-04-28 04:08:48,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1738387517] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:48,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:48,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:08:48,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287790439] [2022-04-28 04:08:48,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 04:08:48,029 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:48,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:50,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:50,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:08:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:50,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:08:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:08:50,254 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:54,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:08:56,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:08:58,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:09:03,473 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:09:05,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:09:07,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 04:09:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,196 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-28 04:09:08,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:09:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 04:09:08,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 04:09:08,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-28 04:09:08,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-28 04:09:10,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:10,447 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:09:10,447 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:09:10,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:09:10,448 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:10,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 46 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 12.9s Time] [2022-04-28 04:09:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:09:10,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:09:10,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:10,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:10,470 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:10,471 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:10,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:10,472 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 04:09:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 04:09:10,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:10,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:10,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 04:09:10,472 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 04:09:10,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:10,473 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 04:09:10,473 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 04:09:10,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:10,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:10,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:10,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-28 04:09:10,474 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-04-28 04:09:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:10,475 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-28 04:09:10,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:10,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-28 04:09:10,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:10,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 04:09:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 04:09:10,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:10,507 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:10,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:09:10,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1646864326, now seen corresponding path program 1 times [2022-04-28 04:09:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:10,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698230437] [2022-04-28 04:10:21,140 WARN L232 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 76 DAG size of output: 30 (called from [L1001] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.checkPropertiesOfLoopAccelerationFormula) [2022-04-28 04:10:25,422 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:29,846 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:32,070 WARN L1072 rdanLoopAcceleration]: Unable to prove that computed reflexive-transitive closure contains sequentialcomposition of relation with itself. [2022-04-28 04:11:23,335 WARN L232 SmtUtils]: Spent 39.90s on a formula simplification. DAG size of input: 76 DAG size of output: 30 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 04:11:23,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult