/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/sum04-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:03:35,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:03:35,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:03:35,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:03:35,264 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:03:35,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:03:35,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:03:35,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:03:35,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:03:35,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:03:35,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:03:35,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:03:35,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:03:35,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:03:35,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:03:35,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:03:35,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:03:35,276 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:03:35,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:03:35,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:03:35,286 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:03:35,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:03:35,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:03:35,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:03:35,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:03:35,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:03:35,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:03:35,301 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:03:35,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:03:35,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:03:35,303 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:03:35,303 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:03:35,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:03:35,304 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:03:35,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:03:35,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:03:35,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:03:35,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:03:35,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:03:35,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:03:35,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:03:35,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:03:35,313 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:03:35,322 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:03:35,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:03:35,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:03:35,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:03:35,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:03:35,325 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:03:35,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:03:35,325 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:03:35,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:03:35,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:03:35,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:03:35,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:35,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:03:35,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:03:35,328 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:03:35,328 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-15 12:03:35,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:03:35,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:03:35,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:03:35,558 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:03:35,559 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:03:35,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04-2.i [2022-04-15 12:03:35,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4c7affb/523815e2976142d9b401995f56205bea/FLAG7bf3873a8 [2022-04-15 12:03:35,989 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:03:35,989 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04-2.i [2022-04-15 12:03:35,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4c7affb/523815e2976142d9b401995f56205bea/FLAG7bf3873a8 [2022-04-15 12:03:36,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e4c7affb/523815e2976142d9b401995f56205bea [2022-04-15 12:03:36,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:03:36,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:03:36,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:36,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:03:36,016 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:03:36,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57502965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36, skipping insertion in model container [2022-04-15 12:03:36,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:03:36,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:03:36,169 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/sum04-2.i[808,821] [2022-04-15 12:03:36,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:36,183 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:03:36,191 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/sum04-2.i[808,821] [2022-04-15 12:03:36,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:03:36,202 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:03:36,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36 WrapperNode [2022-04-15 12:03:36,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:03:36,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:03:36,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:03:36,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:03:36,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,219 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:03:36,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:03:36,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:03:36,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:03:36,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (1/1) ... [2022-04-15 12:03:36,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:03:36,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:03:36,267 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-15 12:03:36,275 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-15 12:03:36,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:03:36,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:03:36,307 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:03:36,307 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:03:36,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:03:36,308 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:03:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:03:36,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:03:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:03:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:03:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:03:36,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:03:36,361 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:03:36,362 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:03:36,479 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:03:36,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:03:36,483 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:03:36,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:36 BoogieIcfgContainer [2022-04-15 12:03:36,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:03:36,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:03:36,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:03:36,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:03:36,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:03:36" (1/3) ... [2022-04-15 12:03:36,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dd2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:36, skipping insertion in model container [2022-04-15 12:03:36,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:03:36" (2/3) ... [2022-04-15 12:03:36,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68dd2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:03:36, skipping insertion in model container [2022-04-15 12:03:36,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:03:36" (3/3) ... [2022-04-15 12:03:36,491 INFO L111 eAbstractionObserver]: Analyzing ICFG sum04-2.i [2022-04-15 12:03:36,494 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:03:36,494 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:03:36,524 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:03:36,528 INFO L340 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 [2022-04-15 12:03:36,529 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:03:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-15 12:03:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:03:36,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:36,568 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:36,569 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:36,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 1 times [2022-04-15 12:03:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:36,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1679510932] [2022-04-15 12:03:36,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:36,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1274873075, now seen corresponding path program 2 times [2022-04-15 12:03:36,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:36,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120379560] [2022-04-15 12:03:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:36,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:36,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#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(10, 2); {22#true} is VALID [2022-04-15 12:03:36,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:03:36,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-15 12:03:36,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:36,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#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(10, 2); {22#true} is VALID [2022-04-15 12:03:36,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:03:36,801 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-15 12:03:36,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2022-04-15 12:03:36,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2022-04-15 12:03:36,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:03:36,803 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2022-04-15 12:03:36,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 12:03:36,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 12:03:36,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:03:36,804 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-15 12:03:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:36,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120379560] [2022-04-15 12:03:36,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120379560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:36,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:36,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:03:36,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:36,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1679510932] [2022-04-15 12:03:36,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1679510932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:36,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:36,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:03:36,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062532825] [2022-04-15 12:03:36,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:36,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 12:03:36,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:36,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 12:03:36,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:36,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:03:36,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:36,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:03:36,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:03:36,873 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 12:03:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:36,966 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 12:03:36,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:03:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-15 12:03:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 12:03:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-15 12:03:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 12:03:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2022-04-15 12:03:36,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2022-04-15 12:03:37,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,032 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:03:37,032 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:03:37,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:03:37,040 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:37,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 21 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:03:37,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:03:37,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:03:37,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:37,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-15 12:03:37,068 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-15 12:03:37,068 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-15 12:03:37,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,070 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:03:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:03:37,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:37,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:37,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-15 12:03:37,071 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-15 12:03:37,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,073 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:03:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:03:37,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:37,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:37,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:37,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-15 12:03:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:03:37,076 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:03:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:37,076 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:03:37,076 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-15 12:03:37,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:03:37,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:03:37,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:03:37,097 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:37,099 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:37,100 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:03:37,105 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 1 times [2022-04-15 12:03:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:37,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767730131] [2022-04-15 12:03:37,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:03:37,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1280414201, now seen corresponding path program 2 times [2022-04-15 12:03:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:37,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492026062] [2022-04-15 12:03:37,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:37,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:37,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#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(10, 2); {142#true} is VALID [2022-04-15 12:03:37,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:03:37,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-15 12:03:37,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:37,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#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(10, 2); {142#true} is VALID [2022-04-15 12:03:37,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:03:37,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-15 12:03:37,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret2 := main(); {142#true} is VALID [2022-04-15 12:03:37,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {147#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:37,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= (+ (- 1) main_~i~0) 0)} assume !(~i~0 <= 8); {143#false} is VALID [2022-04-15 12:03:37,199 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {143#false} is VALID [2022-04-15 12:03:37,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 12:03:37,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 12:03:37,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 12:03:37,200 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-15 12:03:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:37,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492026062] [2022-04-15 12:03:37,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492026062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:37,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:37,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:03:37,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:37,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767730131] [2022-04-15 12:03:37,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767730131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:37,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:37,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:03:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379946907] [2022-04-15 12:03:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:37,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 12:03:37,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:37,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 12:03:37,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:03:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:37,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:03:37,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:03:37,228 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 12:03:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,272 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 12:03:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:03:37,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-15 12:03:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:37,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 12:03:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-15 12:03:37,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 12:03:37,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-04-15 12:03:37,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 20 transitions. [2022-04-15 12:03:37,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,291 INFO L225 Difference]: With dead ends: 20 [2022-04-15 12:03:37,292 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:03:37,292 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:03:37,293 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:37,293 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 18 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:03:37,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:03:37,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-15 12:03:37,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:37,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-15 12:03:37,297 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-15 12:03:37,297 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-15 12:03:37,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,298 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:03:37,298 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:03:37,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:37,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:37,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 15 states. [2022-04-15 12:03:37,298 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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 15 states. [2022-04-15 12:03:37,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,299 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 12:03:37,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:03:37,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:37,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:37,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:37,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-15 12:03:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 12:03:37,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2022-04-15 12:03:37,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:37,301 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 12:03:37,301 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-15 12:03:37,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 12:03:37,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:03:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:03:37,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:37,314 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:37,314 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:03:37,314 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:37,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:37,314 INFO L85 PathProgramCache]: Analyzing trace with hash -985852763, now seen corresponding path program 1 times [2022-04-15 12:03:37,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:37,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1281145237] [2022-04-15 12:03:37,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -87506669, now seen corresponding path program 1 times [2022-04-15 12:03:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:37,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46476652] [2022-04-15 12:03:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:37,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:37,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(and (= |#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(10, 2); {251#true} is VALID [2022-04-15 12:03:37,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 12:03:37,516 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 12:03:37,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:37,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(and (= |#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(10, 2); {251#true} is VALID [2022-04-15 12:03:37,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 12:03:37,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 12:03:37,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret2 := main(); {251#true} is VALID [2022-04-15 12:03:37,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {256#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:37,519 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= (+ (- 1) main_~i~0) 0)} [46] L24-3-->L24-4_primed: Formula: (or (let ((.cse1 (* v_main_~i~0_Out_2 2)) (.cse0 (* (- 1) v_main_~sn~0_In_1))) (and (<= 0 (div (+ .cse0 v_main_~sn~0_Out_2) 2)) (= (mod (+ v_main_~sn~0_In_1 v_main_~sn~0_Out_2) 2) 0) (= .cse1 0) (= .cse1 (* v_main_~i~0_In_1 2)) (let ((.cse2 (* 2 |v_main_#t~post1_Out_2|))) (= (+ (* (- 1) v_main_~sn~0_Out_2) .cse2) (+ .cse0 .cse2))) (<= v_main_~i~0_Out_2 9))) (and (= v_main_~sn~0_In_1 v_main_~sn~0_Out_2) (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) InVars {main_~sn~0=v_main_~sn~0_In_1, main_~i~0=v_main_~i~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_~sn~0=v_main_~sn~0_Out_2, main_#t~post1=|v_main_#t~post1_Out_2|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {257#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:37,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#(<= main_~i~0 1)} [45] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-15 12:03:37,520 INFO L272 TraceCheckUtils]: 8: Hoare triple {252#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {252#false} is VALID [2022-04-15 12:03:37,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-15 12:03:37,520 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-15 12:03:37,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-15 12:03:37,520 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-15 12:03:37,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:37,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46476652] [2022-04-15 12:03:37,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46476652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:37,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:37,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:37,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1281145237] [2022-04-15 12:03:37,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1281145237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:37,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:37,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:37,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798461422] [2022-04-15 12:03:37,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:37,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 12:03:37,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:37,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:03:37,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:03:37,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:37,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:03:37,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:03:37,563 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:03:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,623 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:03:37,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:03:37,623 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 12:03:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:37,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:03:37,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-15 12:03:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:03:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-15 12:03:37,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-15 12:03:37,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,643 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:03:37,643 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:03:37,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:03:37,644 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:37,644 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:03:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:03:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 12:03:37,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:37,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-15 12:03:37,647 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-15 12:03:37,647 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-15 12:03:37,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,648 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:03:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:03:37,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:37,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:37,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 17 states. [2022-04-15 12:03:37,649 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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 17 states. [2022-04-15 12:03:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,650 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:03:37,650 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:03:37,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:37,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:37,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:37,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-15 12:03:37,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 12:03:37,651 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2022-04-15 12:03:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:37,651 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 12:03:37,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-15 12:03:37,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 12:03:37,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:03:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:03:37,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:37,665 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:37,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:03:37,666 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1380152381, now seen corresponding path program 2 times [2022-04-15 12:03:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:37,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [486827971] [2022-04-15 12:03:37,779 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash -28401325, now seen corresponding path program 1 times [2022-04-15 12:03:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:37,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465575334] [2022-04-15 12:03:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:37,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:37,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:37,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {383#(and (= |#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(10, 2); {376#true} is VALID [2022-04-15 12:03:37,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-15 12:03:37,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {376#true} {376#true} #42#return; {376#true} is VALID [2022-04-15 12:03:37,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:37,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {383#(and (= |#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(10, 2); {376#true} is VALID [2022-04-15 12:03:37,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2022-04-15 12:03:37,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #42#return; {376#true} is VALID [2022-04-15 12:03:37,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret2 := main(); {376#true} is VALID [2022-04-15 12:03:37,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {376#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {381#(= main_~i~0 1)} is VALID [2022-04-15 12:03:37,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#(= main_~i~0 1)} [48] L24-3-->L24-4_primed: Formula: (or (and (= v_main_~sn~0_In_2 v_main_~sn~0_Out_4) (= v_main_~i~0_In_2 v_main_~i~0_Out_4)) (let ((.cse1 (* (- 1) v_main_~sn~0_In_2)) (.cse2 (* v_main_~i~0_Out_4 2))) (and (let ((.cse0 (* 2 |v_main_#t~post1_Out_4|))) (= (+ .cse0 (* (- 1) v_main_~sn~0_Out_4)) (+ .cse0 .cse1))) (= (mod (+ v_main_~sn~0_In_2 v_main_~sn~0_Out_4) 2) 0) (= .cse2 0) (<= v_main_~i~0_Out_4 9) (<= 0 (div (+ v_main_~sn~0_Out_4 .cse1) 2)) (= .cse2 (* v_main_~i~0_In_2 2))))) InVars {main_~sn~0=v_main_~sn~0_In_2, main_~i~0=v_main_~i~0_In_2} OutVars{main_~i~0=v_main_~i~0_Out_4, main_~sn~0=v_main_~sn~0_Out_4, main_#t~post1=|v_main_#t~post1_Out_4|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {382#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:37,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {382#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} [47] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {377#false} is VALID [2022-04-15 12:03:37,845 INFO L272 TraceCheckUtils]: 8: Hoare triple {377#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {377#false} is VALID [2022-04-15 12:03:37,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#false} ~cond := #in~cond; {377#false} is VALID [2022-04-15 12:03:37,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {377#false} assume 0 == ~cond; {377#false} is VALID [2022-04-15 12:03:37,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {377#false} assume !false; {377#false} is VALID [2022-04-15 12:03:37,845 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-15 12:03:37,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:37,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465575334] [2022-04-15 12:03:37,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465575334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:37,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:37,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:37,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:37,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [486827971] [2022-04-15 12:03:37,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [486827971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:37,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:37,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:03:37,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893269605] [2022-04-15 12:03:37,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:37,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:37,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:37,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:37,892 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-15 12:03:37,892 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:03:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:37,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:03:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:03:37,894 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:37,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:37,986 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:03:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:03:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 12:03:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-04-15 12:03:37,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-04-15 12:03:38,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:38,030 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:03:38,030 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:03:38,030 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:03:38,031 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:38,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:03:38,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:03:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-15 12:03:38,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:38,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-15 12:03:38,034 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-15 12:03:38,034 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-15 12:03:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:38,035 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:03:38,035 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:03:38,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:38,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:38,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 19 states. [2022-04-15 12:03:38,036 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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 19 states. [2022-04-15 12:03:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:38,037 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:03:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:03:38,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:38,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:38,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:38,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 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-15 12:03:38,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 12:03:38,038 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2022-04-15 12:03:38,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:38,038 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 12:03:38,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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-15 12:03:38,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 12:03:38,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 12:03:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:03:38,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:38,053 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:38,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:03:38,053 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:38,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1950004065, now seen corresponding path program 3 times [2022-04-15 12:03:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:38,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142272844] [2022-04-15 12:03:38,187 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:38,189 INFO L85 PathProgramCache]: Analyzing trace with hash 30704019, now seen corresponding path program 1 times [2022-04-15 12:03:38,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:38,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939048688] [2022-04-15 12:03:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:38,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {523#(and (= |#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(10, 2); {516#true} is VALID [2022-04-15 12:03:38,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-15 12:03:38,243 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {516#true} {516#true} #42#return; {516#true} is VALID [2022-04-15 12:03:38,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {523#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:38,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#(and (= |#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(10, 2); {516#true} is VALID [2022-04-15 12:03:38,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-15 12:03:38,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #42#return; {516#true} is VALID [2022-04-15 12:03:38,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret2 := main(); {516#true} is VALID [2022-04-15 12:03:38,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {521#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:38,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {521#(= (+ (- 1) main_~i~0) 0)} [50] L24-3-->L24-4_primed: Formula: (or (let ((.cse0 (* v_main_~i~0_Out_6 2)) (.cse1 (* (- 1) v_main_~sn~0_Out_6))) (and (= .cse0 (* v_main_~i~0_In_3 2)) (<= v_main_~i~0_Out_6 9) (<= 0 (div (+ v_main_~sn~0_In_3 .cse1) (- 2))) (= .cse0 0) (let ((.cse2 (* 2 |v_main_#t~post1_Out_6|))) (= (+ .cse1 .cse2) (+ (* (- 1) v_main_~sn~0_In_3) .cse2))) (= (mod (+ v_main_~sn~0_In_3 v_main_~sn~0_Out_6) 2) 0))) (and (= v_main_~i~0_In_3 v_main_~i~0_Out_6) (= v_main_~sn~0_In_3 v_main_~sn~0_Out_6))) InVars {main_~sn~0=v_main_~sn~0_In_3, main_~i~0=v_main_~i~0_In_3} OutVars{main_~i~0=v_main_~i~0_Out_6, main_~sn~0=v_main_~sn~0_Out_6, main_#t~post1=|v_main_#t~post1_Out_6|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {522#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:38,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {522#(<= main_~i~0 1)} [49] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {517#false} is VALID [2022-04-15 12:03:38,246 INFO L272 TraceCheckUtils]: 8: Hoare triple {517#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {517#false} is VALID [2022-04-15 12:03:38,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#false} ~cond := #in~cond; {517#false} is VALID [2022-04-15 12:03:38,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#false} assume 0 == ~cond; {517#false} is VALID [2022-04-15 12:03:38,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {517#false} assume !false; {517#false} is VALID [2022-04-15 12:03:38,247 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-15 12:03:38,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:38,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939048688] [2022-04-15 12:03:38,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939048688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:38,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:38,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:38,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:38,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142272844] [2022-04-15 12:03:38,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142272844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:38,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:38,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:03:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729209254] [2022-04-15 12:03:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:38,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-15 12:03:38,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:38,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-15 12:03:38,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:38,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:03:38,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:38,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:03:38,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:03:38,324 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-15 12:03:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:38,473 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 12:03:38,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:03:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 17 [2022-04-15 12:03:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-15 12:03:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-15 12:03:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-15 12:03:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-04-15 12:03:38,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-04-15 12:03:38,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:38,497 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:03:38,497 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:03:38,497 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:03:38,498 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:38,498 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 33 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:03:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:03:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 12:03:38,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:38,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-15 12:03:38,501 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-15 12:03:38,502 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-15 12:03:38,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:38,502 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:03:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:03:38,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:38,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:38,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 21 states. [2022-04-15 12:03:38,515 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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 21 states. [2022-04-15 12:03:38,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:38,516 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 12:03:38,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 12:03:38,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:38,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:38,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:38,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-15 12:03:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 12:03:38,517 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2022-04-15 12:03:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:38,518 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 12:03:38,518 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-15 12:03:38,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 12:03:38,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:38,538 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 12:03:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:03:38,539 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:38,539 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:38,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:03:38,539 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:38,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1815254145, now seen corresponding path program 4 times [2022-04-15 12:03:38,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:38,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374936727] [2022-04-15 12:03:38,700 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 89809363, now seen corresponding path program 1 times [2022-04-15 12:03:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:38,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620030323] [2022-04-15 12:03:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:38,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:38,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#(and (= |#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(10, 2); {671#true} is VALID [2022-04-15 12:03:38,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-15 12:03:38,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {671#true} {671#true} #42#return; {671#true} is VALID [2022-04-15 12:03:38,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {671#true} call ULTIMATE.init(); {678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:38,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#(and (= |#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(10, 2); {671#true} is VALID [2022-04-15 12:03:38,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#true} assume true; {671#true} is VALID [2022-04-15 12:03:38,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {671#true} {671#true} #42#return; {671#true} is VALID [2022-04-15 12:03:38,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {671#true} call #t~ret2 := main(); {671#true} is VALID [2022-04-15 12:03:38,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {676#(= (+ (- 1) main_~i~0) 0)} is VALID [2022-04-15 12:03:38,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {676#(= (+ (- 1) main_~i~0) 0)} [52] L24-3-->L24-4_primed: Formula: (or (let ((.cse0 (* v_main_~i~0_Out_8 2)) (.cse1 (* (- 1) v_main_~sn~0_Out_8))) (and (= (* v_main_~i~0_In_4 2) .cse0) (= .cse0 0) (= (mod (+ v_main_~sn~0_In_4 v_main_~sn~0_Out_8) 2) 0) (<= 0 (div (+ v_main_~sn~0_In_4 .cse1) (- 2))) (let ((.cse2 (* 2 |v_main_#t~post1_Out_8|))) (= (+ .cse1 .cse2) (+ (* (- 1) v_main_~sn~0_In_4) .cse2))) (<= v_main_~i~0_Out_8 9))) (and (= v_main_~sn~0_In_4 v_main_~sn~0_Out_8) (= v_main_~i~0_In_4 v_main_~i~0_Out_8))) InVars {main_~sn~0=v_main_~sn~0_In_4, main_~i~0=v_main_~i~0_In_4} OutVars{main_~i~0=v_main_~i~0_Out_8, main_~sn~0=v_main_~sn~0_Out_8, main_#t~post1=|v_main_#t~post1_Out_8|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {677#(<= main_~i~0 1)} is VALID [2022-04-15 12:03:38,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {677#(<= main_~i~0 1)} [51] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {672#false} is VALID [2022-04-15 12:03:38,741 INFO L272 TraceCheckUtils]: 8: Hoare triple {672#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {672#false} is VALID [2022-04-15 12:03:38,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {672#false} ~cond := #in~cond; {672#false} is VALID [2022-04-15 12:03:38,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {672#false} assume 0 == ~cond; {672#false} is VALID [2022-04-15 12:03:38,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {672#false} assume !false; {672#false} is VALID [2022-04-15 12:03:38,741 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-15 12:03:38,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:38,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620030323] [2022-04-15 12:03:38,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620030323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:38,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:38,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:38,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:38,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374936727] [2022-04-15 12:03:38,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374936727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:38,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:38,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:03:38,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721114007] [2022-04-15 12:03:38,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 19 [2022-04-15 12:03:38,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:38,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-15 12:03:38,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:38,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:03:38,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:03:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:03:38,822 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-15 12:03:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:38,997 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 12:03:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:03:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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 19 [2022-04-15 12:03:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-15 12:03:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-15 12:03:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-15 12:03:38,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 28 transitions. [2022-04-15 12:03:38,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 28 transitions. [2022-04-15 12:03:39,019 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-15 12:03:39,020 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:03:39,020 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:03:39,020 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:03:39,021 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:39,021 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:39,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:03:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 12:03:39,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:39,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-15 12:03:39,024 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-15 12:03:39,025 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-15 12:03:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:39,025 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:03:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:03:39,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:39,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:39,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-15 12:03:39,026 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-15 12:03:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:39,027 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:03:39,027 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:03:39,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:39,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:39,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:39,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-15 12:03:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 12:03:39,028 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2022-04-15 12:03:39,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:39,028 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 12:03:39,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 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-15 12:03:39,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 12:03:39,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 12:03:39,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:03:39,047 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:39,047 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:39,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:03:39,047 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:39,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:39,048 INFO L85 PathProgramCache]: Analyzing trace with hash 429036573, now seen corresponding path program 5 times [2022-04-15 12:03:39,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:39,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728810070] [2022-04-15 12:03:39,162 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:39,164 INFO L85 PathProgramCache]: Analyzing trace with hash 148914707, now seen corresponding path program 1 times [2022-04-15 12:03:39,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:39,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951035342] [2022-04-15 12:03:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:39,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:39,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {848#(and (= |#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(10, 2); {841#true} is VALID [2022-04-15 12:03:39,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {841#true} assume true; {841#true} is VALID [2022-04-15 12:03:39,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {841#true} {841#true} #42#return; {841#true} is VALID [2022-04-15 12:03:39,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {841#true} call ULTIMATE.init(); {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:39,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#(and (= |#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(10, 2); {841#true} is VALID [2022-04-15 12:03:39,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {841#true} assume true; {841#true} is VALID [2022-04-15 12:03:39,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {841#true} {841#true} #42#return; {841#true} is VALID [2022-04-15 12:03:39,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {841#true} call #t~ret2 := main(); {841#true} is VALID [2022-04-15 12:03:39,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {841#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {846#(= main_~i~0 1)} is VALID [2022-04-15 12:03:39,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {846#(= main_~i~0 1)} [54] L24-3-->L24-4_primed: Formula: (or (and (= v_main_~sn~0_In_5 v_main_~sn~0_Out_10) (= v_main_~i~0_In_5 v_main_~i~0_Out_10)) (let ((.cse0 (* v_main_~i~0_Out_10 2)) (.cse1 (* (- 1) v_main_~sn~0_In_5))) (and (<= v_main_~i~0_Out_10 9) (= .cse0 (* v_main_~i~0_In_5 2)) (= .cse0 0) (= (mod (+ v_main_~sn~0_In_5 v_main_~sn~0_Out_10) 2) 0) (<= 0 (div (+ .cse1 v_main_~sn~0_Out_10) 2)) (let ((.cse2 (* 2 |v_main_#t~post1_Out_10|))) (= (+ (* (- 1) v_main_~sn~0_Out_10) .cse2) (+ .cse1 .cse2)))))) InVars {main_~sn~0=v_main_~sn~0_In_5, main_~i~0=v_main_~i~0_In_5} OutVars{main_~i~0=v_main_~i~0_Out_10, main_~sn~0=v_main_~sn~0_Out_10, main_#t~post1=|v_main_#t~post1_Out_10|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {847#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:39,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {847#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} [53] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {842#false} is VALID [2022-04-15 12:03:39,206 INFO L272 TraceCheckUtils]: 8: Hoare triple {842#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {842#false} is VALID [2022-04-15 12:03:39,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {842#false} ~cond := #in~cond; {842#false} is VALID [2022-04-15 12:03:39,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {842#false} assume 0 == ~cond; {842#false} is VALID [2022-04-15 12:03:39,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {842#false} assume !false; {842#false} is VALID [2022-04-15 12:03:39,206 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-15 12:03:39,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:39,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951035342] [2022-04-15 12:03:39,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951035342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:39,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:39,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:39,275 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:39,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728810070] [2022-04-15 12:03:39,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728810070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:39,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:39,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:03:39,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930208151] [2022-04-15 12:03:39,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 21 [2022-04-15 12:03:39,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:39,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-15 12:03:39,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:39,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:03:39,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:03:39,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:03:39,289 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-15 12:03:39,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:39,500 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 12:03:39,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:03:39,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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 21 [2022-04-15 12:03:39,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:39,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-15 12:03:39,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-15 12:03:39,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-15 12:03:39,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 30 transitions. [2022-04-15 12:03:39,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 30 transitions. [2022-04-15 12:03:39,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:39,531 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:03:39,531 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:03:39,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:03:39,533 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:39,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 43 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:39,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:03:39,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-04-15 12:03:39,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:39,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-15 12:03:39,541 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-15 12:03:39,541 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-15 12:03:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:39,544 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:03:39,544 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:03:39,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:39,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:39,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 25 states. [2022-04-15 12:03:39,545 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 25 states. [2022-04-15 12:03:39,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:39,548 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 12:03:39,548 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 12:03:39,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:39,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:39,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:39,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-15 12:03:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 12:03:39,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2022-04-15 12:03:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:39,551 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 12:03:39,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 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-15 12:03:39,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 12:03:39,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 12:03:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:03:39,569 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:39,570 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:39,570 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:03:39,570 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1118833979, now seen corresponding path program 6 times [2022-04-15 12:03:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [822418083] [2022-04-15 12:03:39,725 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 208020051, now seen corresponding path program 1 times [2022-04-15 12:03:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:39,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527646749] [2022-04-15 12:03:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:39,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:39,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {1033#(and (= |#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(10, 2); {1026#true} is VALID [2022-04-15 12:03:39,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-15 12:03:39,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1026#true} {1026#true} #42#return; {1026#true} is VALID [2022-04-15 12:03:39,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {1026#true} call ULTIMATE.init(); {1033#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:39,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#(and (= |#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(10, 2); {1026#true} is VALID [2022-04-15 12:03:39,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {1026#true} assume true; {1026#true} is VALID [2022-04-15 12:03:39,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1026#true} {1026#true} #42#return; {1026#true} is VALID [2022-04-15 12:03:39,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {1026#true} call #t~ret2 := main(); {1026#true} is VALID [2022-04-15 12:03:39,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {1026#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1031#(= main_~i~0 1)} is VALID [2022-04-15 12:03:39,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(= main_~i~0 1)} [56] L24-3-->L24-4_primed: Formula: (or (and (= v_main_~i~0_In_6 v_main_~i~0_Out_12) (= v_main_~sn~0_In_6 v_main_~sn~0_Out_12)) (let ((.cse1 (* v_main_~i~0_Out_12 2)) (.cse0 (* (- 1) v_main_~sn~0_Out_12))) (and (<= 0 (div (+ .cse0 v_main_~sn~0_In_6) (- 2))) (= .cse1 0) (= (* v_main_~i~0_In_6 2) .cse1) (= (mod (+ v_main_~sn~0_In_6 v_main_~sn~0_Out_12) 2) 0) (<= v_main_~i~0_Out_12 9) (let ((.cse2 (* 2 |v_main_#t~post1_Out_12|))) (= (+ .cse0 .cse2) (+ (* (- 1) v_main_~sn~0_In_6) .cse2)))))) InVars {main_~sn~0=v_main_~sn~0_In_6, main_~i~0=v_main_~i~0_In_6} OutVars{main_~i~0=v_main_~i~0_Out_12, main_~sn~0=v_main_~sn~0_Out_12, main_#t~post1=|v_main_#t~post1_Out_12|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1032#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:39,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} [55] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {1027#false} is VALID [2022-04-15 12:03:39,776 INFO L272 TraceCheckUtils]: 8: Hoare triple {1027#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1027#false} is VALID [2022-04-15 12:03:39,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {1027#false} ~cond := #in~cond; {1027#false} is VALID [2022-04-15 12:03:39,776 INFO L290 TraceCheckUtils]: 10: Hoare triple {1027#false} assume 0 == ~cond; {1027#false} is VALID [2022-04-15 12:03:39,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {1027#false} assume !false; {1027#false} is VALID [2022-04-15 12:03:39,777 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-15 12:03:39,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:39,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527646749] [2022-04-15 12:03:39,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527646749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:39,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:39,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:39,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:39,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [822418083] [2022-04-15 12:03:39,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [822418083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:39,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:39,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:03:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965034956] [2022-04-15 12:03:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 23 [2022-04-15 12:03:39,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:39,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 12:03:39,870 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-15 12:03:39,870 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:03:39,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:39,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:03:39,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:03:39,871 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 12:03:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:40,117 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 12:03:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:03:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 23 [2022-04-15 12:03:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:40,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 12:03:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-15 12:03:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 12:03:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-15 12:03:40,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-15 12:03:40,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:40,147 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:03:40,147 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:03:40,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:03:40,148 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:40,148 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:03:40,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 12:03:40,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:40,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-15 12:03:40,152 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-15 12:03:40,152 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-15 12:03:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:40,152 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:03:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:03:40,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:40,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:40,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 27 states. [2022-04-15 12:03:40,153 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 27 states. [2022-04-15 12:03:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:40,154 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:03:40,154 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:03:40,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:40,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:40,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:40,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:40,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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-15 12:03:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 12:03:40,155 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2022-04-15 12:03:40,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:40,155 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 12:03:40,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-15 12:03:40,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 12:03:40,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 12:03:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:03:40,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:40,174 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:40,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:03:40,174 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1705789735, now seen corresponding path program 7 times [2022-04-15 12:03:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:40,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [896110424] [2022-04-15 12:03:40,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:40,312 INFO L85 PathProgramCache]: Analyzing trace with hash 267125395, now seen corresponding path program 1 times [2022-04-15 12:03:40,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:40,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639922405] [2022-04-15 12:03:40,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:40,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:40,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {1233#(and (= |#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(10, 2); {1226#true} is VALID [2022-04-15 12:03:40,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-15 12:03:40,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1226#true} {1226#true} #42#return; {1226#true} is VALID [2022-04-15 12:03:40,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:40,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1233#(and (= |#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(10, 2); {1226#true} is VALID [2022-04-15 12:03:40,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2022-04-15 12:03:40,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #42#return; {1226#true} is VALID [2022-04-15 12:03:40,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret2 := main(); {1226#true} is VALID [2022-04-15 12:03:40,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {1226#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1231#(= main_~i~0 1)} is VALID [2022-04-15 12:03:40,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {1231#(= main_~i~0 1)} [58] L24-3-->L24-4_primed: Formula: (or (and (= v_main_~sn~0_In_7 v_main_~sn~0_Out_14) (= v_main_~i~0_In_7 v_main_~i~0_Out_14)) (let ((.cse2 (* (- 1) v_main_~sn~0_Out_14)) (.cse0 (* v_main_~i~0_Out_14 2))) (and (= .cse0 0) (let ((.cse1 (* 2 |v_main_#t~post1_Out_14|))) (= (+ .cse1 (* (- 1) v_main_~sn~0_In_7)) (+ .cse2 .cse1))) (<= 0 (div (+ v_main_~sn~0_In_7 .cse2) (- 2))) (<= v_main_~i~0_Out_14 9) (= (mod (+ v_main_~sn~0_In_7 v_main_~sn~0_Out_14) 2) 0) (= .cse0 (* v_main_~i~0_In_7 2))))) InVars {main_~sn~0=v_main_~sn~0_In_7, main_~i~0=v_main_~i~0_In_7} OutVars{main_~i~0=v_main_~i~0_Out_14, main_~sn~0=v_main_~sn~0_Out_14, main_#t~post1=|v_main_#t~post1_Out_14|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1232#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:40,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {1232#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} [57] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {1227#false} is VALID [2022-04-15 12:03:40,345 INFO L272 TraceCheckUtils]: 8: Hoare triple {1227#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1227#false} is VALID [2022-04-15 12:03:40,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#false} ~cond := #in~cond; {1227#false} is VALID [2022-04-15 12:03:40,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {1227#false} assume 0 == ~cond; {1227#false} is VALID [2022-04-15 12:03:40,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2022-04-15 12:03:40,346 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-15 12:03:40,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:40,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639922405] [2022-04-15 12:03:40,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639922405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:40,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:40,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:40,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:40,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [896110424] [2022-04-15 12:03:40,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [896110424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:40,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:40,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:03:40,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326106385] [2022-04-15 12:03:40,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:40,446 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 25 [2022-04-15 12:03:40,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:40,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-15 12:03:40,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:40,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:03:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:03:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:03:40,464 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-15 12:03:40,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:40,798 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 12:03:40,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:03:40,798 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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 25 [2022-04-15 12:03:40,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:03:40,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-15 12:03:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-15 12:03:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-15 12:03:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 34 transitions. [2022-04-15 12:03:40,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 34 transitions. [2022-04-15 12:03:40,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:03:40,825 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:03:40,826 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:03:40,826 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:03:40,826 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:03:40,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 53 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:03:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:03:40,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 12:03:40,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:03:40,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-15 12:03:40,830 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-15 12:03:40,830 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-15 12:03:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:40,831 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:03:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:03:40,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:40,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:40,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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 29 states. [2022-04-15 12:03:40,831 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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 29 states. [2022-04-15 12:03:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:03:40,832 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 12:03:40,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 12:03:40,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:03:40,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:03:40,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:03:40,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:03:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 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-15 12:03:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 12:03:40,833 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2022-04-15 12:03:40,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:03:40,833 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 12:03:40,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 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-15 12:03:40,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 12:03:40,881 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-15 12:03:40,881 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 12:03:40,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:03:40,882 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:03:40,882 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:03:40,882 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:03:40,882 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:03:40,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:03:40,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1749847817, now seen corresponding path program 8 times [2022-04-15 12:03:40,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:03:40,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695806327] [2022-04-15 12:03:41,013 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:03:41,014 INFO L85 PathProgramCache]: Analyzing trace with hash 326230739, now seen corresponding path program 1 times [2022-04-15 12:03:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:03:41,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118053010] [2022-04-15 12:03:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:03:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:03:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:41,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:03:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:03:41,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {1448#(and (= |#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(10, 2); {1441#true} is VALID [2022-04-15 12:03:41,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1441#true} assume true; {1441#true} is VALID [2022-04-15 12:03:41,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1441#true} {1441#true} #42#return; {1441#true} is VALID [2022-04-15 12:03:41,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {1441#true} call ULTIMATE.init(); {1448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:03:41,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {1448#(and (= |#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(10, 2); {1441#true} is VALID [2022-04-15 12:03:41,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1441#true} assume true; {1441#true} is VALID [2022-04-15 12:03:41,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1441#true} {1441#true} #42#return; {1441#true} is VALID [2022-04-15 12:03:41,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {1441#true} call #t~ret2 := main(); {1441#true} is VALID [2022-04-15 12:03:41,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {1441#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {1446#(= main_~i~0 1)} is VALID [2022-04-15 12:03:41,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {1446#(= main_~i~0 1)} [60] L24-3-->L24-4_primed: Formula: (or (and (= v_main_~sn~0_In_8 v_main_~sn~0_Out_16) (= v_main_~i~0_In_8 v_main_~i~0_Out_16)) (let ((.cse1 (* (- 1) v_main_~sn~0_In_8)) (.cse2 (* v_main_~i~0_Out_16 2))) (and (let ((.cse0 (* 2 |v_main_#t~post1_Out_16|))) (= (+ (* (- 1) v_main_~sn~0_Out_16) .cse0) (+ .cse1 .cse0))) (= (mod (+ v_main_~sn~0_In_8 v_main_~sn~0_Out_16) 2) 0) (= .cse2 (* v_main_~i~0_In_8 2)) (<= 0 (div (+ v_main_~sn~0_Out_16 .cse1) 2)) (<= v_main_~i~0_Out_16 9) (= .cse2 0)))) InVars {main_~sn~0=v_main_~sn~0_In_8, main_~i~0=v_main_~i~0_In_8} OutVars{main_~i~0=v_main_~i~0_Out_16, main_~sn~0=v_main_~sn~0_Out_16, main_#t~post1=|v_main_#t~post1_Out_16|} AuxVars[] AssignedVars[main_~sn~0, main_#t~post1, main_~i~0] {1447#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} is VALID [2022-04-15 12:03:41,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {1447#(or (<= main_~i~0 0) (= (+ (- 1) main_~i~0) 0))} [59] L24-4_primed-->L24-4: Formula: (not (<= v_main_~i~0_6 8)) InVars {main_~i~0=v_main_~i~0_6} OutVars{main_~i~0=v_main_~i~0_6} AuxVars[] AssignedVars[] {1442#false} is VALID [2022-04-15 12:03:41,069 INFO L272 TraceCheckUtils]: 8: Hoare triple {1442#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {1442#false} is VALID [2022-04-15 12:03:41,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {1442#false} ~cond := #in~cond; {1442#false} is VALID [2022-04-15 12:03:41,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {1442#false} assume 0 == ~cond; {1442#false} is VALID [2022-04-15 12:03:41,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {1442#false} assume !false; {1442#false} is VALID [2022-04-15 12:03:41,070 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-15 12:03:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:03:41,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118053010] [2022-04-15 12:03:41,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118053010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:41,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:41,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:03:41,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:03:41,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695806327] [2022-04-15 12:03:41,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695806327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:03:41,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:03:41,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:03:41,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947617964] [2022-04-15 12:03:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:03:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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 27 [2022-04-15 12:03:41,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:03:41,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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-15 12:03:41,271 WARN L143 InductivityCheck]: Transition 1456#(= (+ (- 1) main_~i~0) 8) ( _ , call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); , 1457#(and (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1)) (= (+ (- 1) main_~i~0) 8)) ) not inductive [2022-04-15 12:03:41,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:03:41,272 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:03:41,275 INFO L158 Benchmark]: Toolchain (without parser) took 5265.54ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 140.8MB in the beginning and 176.8MB in the end (delta: -36.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2022-04-15 12:03:41,275 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory was 156.9MB in the beginning and 156.8MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:41,276 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.44ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 167.7MB in the end (delta: -27.1MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-15 12:03:41,276 INFO L158 Benchmark]: Boogie Preprocessor took 19.51ms. Allocated memory is still 188.7MB. Free memory was 167.7MB in the beginning and 166.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:03:41,276 INFO L158 Benchmark]: RCFGBuilder took 261.33ms. Allocated memory is still 188.7MB. Free memory was 166.1MB in the beginning and 156.2MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:03:41,276 INFO L158 Benchmark]: TraceAbstraction took 4788.41ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 155.6MB in the beginning and 176.8MB in the end (delta: -21.2MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2022-04-15 12:03:41,277 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory was 156.9MB in the beginning and 156.8MB in the end (delta: 83.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.44ms. Allocated memory is still 188.7MB. Free memory was 140.6MB in the beginning and 167.7MB in the end (delta: -27.1MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.51ms. Allocated memory is still 188.7MB. Free memory was 167.7MB in the beginning and 166.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 261.33ms. Allocated memory is still 188.7MB. Free memory was 166.1MB in the beginning and 156.2MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4788.41ms. Allocated memory was 188.7MB in the beginning and 230.7MB in the end (delta: 41.9MB). Free memory was 155.6MB in the beginning and 176.8MB in the end (delta: -21.2MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:03:41,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...