/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/loop-zilu/benchmark10_conjunctive.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:38:54,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:38:54,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:38:54,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:38:54,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:38:54,338 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:38:54,339 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:38:54,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:38:54,341 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:38:54,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:38:54,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:38:54,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:38:54,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:38:54,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:38:54,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:38:54,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:38:54,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:38:54,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:38:54,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:38:54,348 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:38:54,349 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:38:54,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:38:54,350 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:38:54,351 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:38:54,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:38:54,353 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:38:54,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:38:54,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:38:54,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:38:54,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:38:54,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:38:54,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:38:54,355 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:38:54,356 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:38:54,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:38:54,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:38:54,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:38:54,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:38:54,357 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:38:54,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:38:54,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:38:54,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:38:54,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:38:54,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:38:54,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:38:54,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:38:54,366 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:38:54,366 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:38:54,366 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:38:54,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:38:54,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:38:54,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:38:54,368 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 10:38:54,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:38:54,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:38:54,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:38:54,582 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:38:54,582 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:38:54,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-28 10:38:54,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b397306/2b31842b5b22451997e1f1201fca405e/FLAGdee2373be [2022-04-28 10:38:54,958 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:38:54,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i [2022-04-28 10:38:54,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b397306/2b31842b5b22451997e1f1201fca405e/FLAGdee2373be [2022-04-28 10:38:54,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9b397306/2b31842b5b22451997e1f1201fca405e [2022-04-28 10:38:54,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:38:54,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:38:54,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:38:54,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:38:54,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:38:54,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:38:54" (1/1) ... [2022-04-28 10:38:54,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@711b87d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:54, skipping insertion in model container [2022-04-28 10:38:54,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:38:54" (1/1) ... [2022-04-28 10:38:54,996 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:38:55,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:38:55,117 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-04-28 10:38:55,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:38:55,143 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:38:55,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark10_conjunctive.i[873,886] [2022-04-28 10:38:55,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:38:55,172 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:38:55,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55 WrapperNode [2022-04-28 10:38:55,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:38:55,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:38:55,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:38:55,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:38:55,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,208 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:38:55,209 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:38:55,209 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:38:55,209 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:38:55,210 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (1/1) ... [2022-04-28 10:38:55,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:38:55,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:55,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 10:38:55,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 10:38:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:38:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:38:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:38:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:38:55,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:38:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:38:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-28 10:38:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-28 10:38:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:38:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:38:55,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:38:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 10:38:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:38:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:38:55,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:38:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:38:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:38:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:38:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:38:55,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:38:55,302 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:38:55,303 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:38:55,456 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:38:55,461 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:38:55,461 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:38:55,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:38:55 BoogieIcfgContainer [2022-04-28 10:38:55,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:38:55,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:38:55,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:38:55,465 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:38:55,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:38:54" (1/3) ... [2022-04-28 10:38:55,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366c1416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:38:55, skipping insertion in model container [2022-04-28 10:38:55,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:38:55" (2/3) ... [2022-04-28 10:38:55,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366c1416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:38:55, skipping insertion in model container [2022-04-28 10:38:55,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:38:55" (3/3) ... [2022-04-28 10:38:55,467 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark10_conjunctive.i [2022-04-28 10:38:55,477 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:38:55,477 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:38:55,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:38:55,515 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@13a1c53c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6ca1d603 [2022-04-28 10:38:55,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:38:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 10:38:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 10:38:55,538 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:55,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:55,539 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:55,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 1 times [2022-04-28 10:38:55,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329974695] [2022-04-28 10:38:55,567 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:38:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1360020621, now seen corresponding path program 2 times [2022-04-28 10:38:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:55,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014974709] [2022-04-28 10:38:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:55,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:55,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(26, 2); {24#true} is VALID [2022-04-28 10:38:55,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:38:55,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 10:38:55,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:55,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(26, 2); {24#true} is VALID [2022-04-28 10:38:55,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 10:38:55,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 10:38:55,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2022-04-28 10:38:55,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {24#true} is VALID [2022-04-28 10:38:55,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(0 == ~c~0 && 0 == ~i~0); {29#(<= main_~i~0 0)} is VALID [2022-04-28 10:38:55,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(<= main_~i~0 0)} assume !(~i~0 < 100); {25#false} is VALID [2022-04-28 10:38:55,758 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {25#false} is VALID [2022-04-28 10:38:55,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 10:38:55,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 10:38:55,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 10:38:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:55,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:55,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014974709] [2022-04-28 10:38:55,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014974709] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:55,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:55,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:38:55,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329974695] [2022-04-28 10:38:55,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329974695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:55,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:55,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:38:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220980992] [2022-04-28 10:38:55,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:55,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:38:55,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:55,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:55,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:55,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:38:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:55,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:38:55,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 10:38:55,807 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:55,971 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-28 10:38:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:38:55,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 10:38:55,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-04-28 10:38:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-04-28 10:38:55,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2022-04-28 10:38:56,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:56,058 INFO L225 Difference]: With dead ends: 38 [2022-04-28 10:38:56,058 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:38:56,060 INFO L412 NwaCegarLoop]: 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-28 10:38:56,067 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:56,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:38:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:38:56,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-28 10:38:56,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:56,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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-28 10:38:56,098 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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-28 10:38:56,098 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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-28 10:38:56,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,103 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 10:38:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 10:38:56,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:56,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:56,104 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 16 states. [2022-04-28 10:38:56,104 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 16 states. [2022-04-28 10:38:56,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,110 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 10:38:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 10:38:56,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:56,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:56,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:56,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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-28 10:38:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 10:38:56,119 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 10:38:56,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:56,119 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 10:38:56,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 10:38:56,136 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-28 10:38:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 10:38:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 10:38:56,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:56,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:56,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:38:56,144 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:56,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 1 times [2022-04-28 10:38:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:56,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [171439652] [2022-04-28 10:38:56,145 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:38:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash 824422544, now seen corresponding path program 2 times [2022-04-28 10:38:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:56,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811967137] [2022-04-28 10:38:56,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:56,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {180#(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(26, 2); {173#true} is VALID [2022-04-28 10:38:56,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 10:38:56,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #50#return; {173#true} is VALID [2022-04-28 10:38:56,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:56,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {180#(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(26, 2); {173#true} is VALID [2022-04-28 10:38:56,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 10:38:56,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #50#return; {173#true} is VALID [2022-04-28 10:38:56,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret3 := main(); {173#true} is VALID [2022-04-28 10:38:56,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {173#true} is VALID [2022-04-28 10:38:56,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {173#true} assume !!(0 == ~c~0 && 0 == ~i~0); {178#(<= 0 main_~i~0)} is VALID [2022-04-28 10:38:56,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {178#(<= 0 main_~i~0)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {179#(<= 1 main_~i~0)} is VALID [2022-04-28 10:38:56,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {179#(<= 1 main_~i~0)} assume ~i~0 <= 0; {174#false} is VALID [2022-04-28 10:38:56,231 INFO L272 TraceCheckUtils]: 9: Hoare triple {174#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {174#false} is VALID [2022-04-28 10:38:56,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#false} ~cond := #in~cond; {174#false} is VALID [2022-04-28 10:38:56,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} assume 0 == ~cond; {174#false} is VALID [2022-04-28 10:38:56,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-28 10:38:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:56,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811967137] [2022-04-28 10:38:56,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811967137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:56,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:56,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:38:56,258 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:56,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [171439652] [2022-04-28 10:38:56,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [171439652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:56,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:56,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:38:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591455001] [2022-04-28 10:38:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:56,260 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-28 10:38:56,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:56,260 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-28 10:38:56,270 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-28 10:38:56,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:38:56,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:56,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:38:56,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:38:56,271 INFO L87 Difference]: Start difference. First operand 15 states and 16 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-28 10:38:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,336 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 10:38:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:38:56,336 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-28 10:38:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:56,336 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-28 10:38:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 10:38:56,338 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-28 10:38:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-04-28 10:38:56,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-04-28 10:38:56,354 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-28 10:38:56,356 INFO L225 Difference]: With dead ends: 20 [2022-04-28 10:38:56,356 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 10:38:56,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:38:56,359 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:56,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 23 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:38:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 10:38:56,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 10:38:56,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:56,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,373 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,374 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,375 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:38:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:38:56,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:56,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:56,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 10:38:56,377 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-28 10:38:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,378 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 10:38:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:38:56,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:56,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:56,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:56,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 10:38:56,380 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 10:38:56,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:56,381 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 10:38:56,381 INFO L496 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-28 10:38:56,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 10:38:56,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:56,393 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 10:38:56,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:38:56,393 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:56,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:56,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:38:56,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:56,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -181933682, now seen corresponding path program 1 times [2022-04-28 10:38:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:56,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660877109] [2022-04-28 10:38:56,415 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:56,415 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:56,415 INFO L85 PathProgramCache]: Analyzing trace with hash -181933682, now seen corresponding path program 2 times [2022-04-28 10:38:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:56,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369868782] [2022-04-28 10:38:56,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:56,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:56,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#(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(26, 2); {287#true} is VALID [2022-04-28 10:38:56,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-28 10:38:56,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {287#true} {287#true} #50#return; {287#true} is VALID [2022-04-28 10:38:56,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} call ULTIMATE.init(); {294#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:56,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#(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(26, 2); {287#true} is VALID [2022-04-28 10:38:56,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-28 10:38:56,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} #50#return; {287#true} is VALID [2022-04-28 10:38:56,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} call #t~ret3 := main(); {287#true} is VALID [2022-04-28 10:38:56,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {287#true} is VALID [2022-04-28 10:38:56,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume !!(0 == ~c~0 && 0 == ~i~0); {292#(<= main_~i~0 0)} is VALID [2022-04-28 10:38:56,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= main_~i~0 0)} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {293#(<= main_~i~0 1)} is VALID [2022-04-28 10:38:56,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(<= main_~i~0 1)} assume !(~i~0 <= 0); {293#(<= main_~i~0 1)} is VALID [2022-04-28 10:38:56,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(<= main_~i~0 1)} assume !(~i~0 < 100); {288#false} is VALID [2022-04-28 10:38:56,491 INFO L272 TraceCheckUtils]: 10: Hoare triple {288#false} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {288#false} is VALID [2022-04-28 10:38:56,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#false} ~cond := #in~cond; {288#false} is VALID [2022-04-28 10:38:56,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#false} assume 0 == ~cond; {288#false} is VALID [2022-04-28 10:38:56,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-04-28 10:38:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:56,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:56,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369868782] [2022-04-28 10:38:56,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369868782] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:56,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3243658] [2022-04-28 10:38:56,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:38:56,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:56,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:56,495 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:38:56,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 10:38:56,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:38:56,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:56,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 10:38:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:56,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:56,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} call ULTIMATE.init(); {287#true} is VALID [2022-04-28 10:38:56,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} #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(26, 2); {287#true} is VALID [2022-04-28 10:38:56,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-28 10:38:56,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} #50#return; {287#true} is VALID [2022-04-28 10:38:56,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} call #t~ret3 := main(); {287#true} is VALID [2022-04-28 10:38:56,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {287#true} is VALID [2022-04-28 10:38:56,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume !!(0 == ~c~0 && 0 == ~i~0); {316#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} is VALID [2022-04-28 10:38:56,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {316#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {320#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:56,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {320#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:56,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= 0 main_~c~0)} assume !(~i~0 < 100); {320#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:56,682 INFO L272 TraceCheckUtils]: 10: Hoare triple {320#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:56,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:56,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {288#false} is VALID [2022-04-28 10:38:56,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-04-28 10:38:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:56,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:56,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-04-28 10:38:56,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {288#false} is VALID [2022-04-28 10:38:56,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:56,832 INFO L272 TraceCheckUtils]: 10: Hoare triple {320#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:56,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(<= 0 main_~c~0)} assume !(~i~0 < 100); {320#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:56,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {320#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {320#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:56,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {359#(<= 0 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {320#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:56,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {287#true} assume !!(0 == ~c~0 && 0 == ~i~0); {359#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-28 10:38:56,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {287#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {287#true} is VALID [2022-04-28 10:38:56,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {287#true} call #t~ret3 := main(); {287#true} is VALID [2022-04-28 10:38:56,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {287#true} {287#true} #50#return; {287#true} is VALID [2022-04-28 10:38:56,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {287#true} assume true; {287#true} is VALID [2022-04-28 10:38:56,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#true} #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(26, 2); {287#true} is VALID [2022-04-28 10:38:56,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {287#true} call ULTIMATE.init(); {287#true} is VALID [2022-04-28 10:38:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:56,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3243658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:56,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:56,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2022-04-28 10:38:56,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:56,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660877109] [2022-04-28 10:38:56,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660877109] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:56,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:56,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:38:56,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215128707] [2022-04-28 10:38:56,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:56,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-28 10:38:56,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:56,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,856 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-28 10:38:56,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:38:56,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:56,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:38:56,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:38:56,857 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,934 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 10:38:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:38:56,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 14 [2022-04-28 10:38:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:56,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-28 10:38:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-04-28 10:38:56,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-04-28 10:38:56,972 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-28 10:38:56,973 INFO L225 Difference]: With dead ends: 22 [2022-04-28 10:38:56,973 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 10:38:56,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:38:56,974 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:56,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:38:56,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 10:38:56,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 10:38:56,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:56,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,994 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,994 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,995 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:38:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:38:56,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:56,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:56,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-28 10:38:56,996 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-28 10:38:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:56,997 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:38:56,997 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:38:56,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:56,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:56,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:56,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 10:38:56,998 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-28 10:38:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:56,998 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 10:38:56,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:56,998 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 10:38:57,011 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-28 10:38:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 10:38:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:38:57,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:38:57,011 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:38:57,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:57,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:57,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:38:57,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:38:57,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1911751447, now seen corresponding path program 3 times [2022-04-28 10:38:57,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:57,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027168551] [2022-04-28 10:38:57,236 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:38:57,236 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:38:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1911751447, now seen corresponding path program 4 times [2022-04-28 10:38:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:38:57,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735724423] [2022-04-28 10:38:57,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:38:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:38:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:38:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:57,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {510#(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(26, 2); {499#true} is VALID [2022-04-28 10:38:57,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} assume true; {499#true} is VALID [2022-04-28 10:38:57,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {499#true} {499#true} #50#return; {499#true} is VALID [2022-04-28 10:38:57,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:38:57,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#(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(26, 2); {499#true} is VALID [2022-04-28 10:38:57,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} assume true; {499#true} is VALID [2022-04-28 10:38:57,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} #50#return; {499#true} is VALID [2022-04-28 10:38:57,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {499#true} call #t~ret3 := main(); {499#true} is VALID [2022-04-28 10:38:57,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {499#true} is VALID [2022-04-28 10:38:57,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {499#true} assume !!(0 == ~c~0 && 0 == ~i~0); {504#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-28 10:38:57,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#(<= 0 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {505#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:57,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {506#(<= 1 (+ main_~i~0 main_~c~0))} is VALID [2022-04-28 10:38:57,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {506#(<= 1 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {507#(<= 1 main_~c~0)} is VALID [2022-04-28 10:38:57,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(<= 1 main_~c~0)} assume !(~i~0 <= 0); {507#(<= 1 main_~c~0)} is VALID [2022-04-28 10:38:57,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#(<= 1 main_~c~0)} assume !(~i~0 < 100); {507#(<= 1 main_~c~0)} is VALID [2022-04-28 10:38:57,334 INFO L272 TraceCheckUtils]: 12: Hoare triple {507#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {508#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:38:57,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {508#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {509#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:38:57,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {509#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {500#false} is VALID [2022-04-28 10:38:57,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {500#false} assume !false; {500#false} is VALID [2022-04-28 10:38:57,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:57,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:38:57,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735724423] [2022-04-28 10:38:57,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735724423] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:38:57,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703553121] [2022-04-28 10:38:57,336 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:38:57,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:38:57,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:38:57,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:38:57,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:38:57,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:38:57,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:38:57,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:38:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:38:57,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:38:57,520 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2022-04-28 10:38:57,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} #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(26, 2); {499#true} is VALID [2022-04-28 10:38:57,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} assume true; {499#true} is VALID [2022-04-28 10:38:57,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} #50#return; {499#true} is VALID [2022-04-28 10:38:57,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {499#true} call #t~ret3 := main(); {499#true} is VALID [2022-04-28 10:38:57,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {499#true} is VALID [2022-04-28 10:38:57,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {499#true} assume !!(0 == ~c~0 && 0 == ~i~0); {532#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} is VALID [2022-04-28 10:38:57,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {532#(and (<= 0 main_~c~0) (<= 0 main_~i~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {505#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:57,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {539#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} is VALID [2022-04-28 10:38:57,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#(and (<= 0 main_~c~0) (not (<= main_~i~0 0)))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {507#(<= 1 main_~c~0)} is VALID [2022-04-28 10:38:57,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(<= 1 main_~c~0)} assume !(~i~0 <= 0); {507#(<= 1 main_~c~0)} is VALID [2022-04-28 10:38:57,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#(<= 1 main_~c~0)} assume !(~i~0 < 100); {507#(<= 1 main_~c~0)} is VALID [2022-04-28 10:38:57,526 INFO L272 TraceCheckUtils]: 12: Hoare triple {507#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:57,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:57,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {500#false} is VALID [2022-04-28 10:38:57,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {500#false} assume !false; {500#false} is VALID [2022-04-28 10:38:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:57,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:38:57,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {500#false} assume !false; {500#false} is VALID [2022-04-28 10:38:57,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {500#false} is VALID [2022-04-28 10:38:57,706 INFO L290 TraceCheckUtils]: 13: Hoare triple {552#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:38:57,707 INFO L272 TraceCheckUtils]: 12: Hoare triple {505#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 >= 0 then 1 else 0)); {552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:38:57,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {505#(<= 0 main_~c~0)} assume !(~i~0 < 100); {505#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:57,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(<= 0 main_~c~0)} assume !(~i~0 <= 0); {505#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:57,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#(<= 0 (+ main_~i~0 main_~c~0))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {505#(<= 0 main_~c~0)} is VALID [2022-04-28 10:38:57,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {584#(<= 0 (+ main_~c~0 1))} assume !(~i~0 <= 0); {504#(<= 0 (+ main_~i~0 main_~c~0))} is VALID [2022-04-28 10:38:57,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {588#(<= 0 (+ main_~i~0 main_~c~0 1))} assume !!(~i~0 < 100);~c~0 := ~c~0 + ~i~0;~i~0 := 1 + ~i~0; {584#(<= 0 (+ main_~c~0 1))} is VALID [2022-04-28 10:38:57,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {499#true} assume !!(0 == ~c~0 && 0 == ~i~0); {588#(<= 0 (+ main_~i~0 main_~c~0 1))} is VALID [2022-04-28 10:38:57,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~i~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~c~0 := #t~nondet2;havoc #t~nondet2; {499#true} is VALID [2022-04-28 10:38:57,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {499#true} call #t~ret3 := main(); {499#true} is VALID [2022-04-28 10:38:57,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {499#true} {499#true} #50#return; {499#true} is VALID [2022-04-28 10:38:57,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {499#true} assume true; {499#true} is VALID [2022-04-28 10:38:57,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {499#true} #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(26, 2); {499#true} is VALID [2022-04-28 10:38:57,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {499#true} call ULTIMATE.init(); {499#true} is VALID [2022-04-28 10:38:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:38:57,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703553121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:38:57,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:38:57,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 10:38:57,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:38:57,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027168551] [2022-04-28 10:38:57,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027168551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:38:57,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:38:57,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:38:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164632691] [2022-04-28 10:38:57,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:38:57,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:38:57,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:38:57,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:57,733 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-28 10:38:57,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:38:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:38:57,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:38:57,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:38:57,734 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:57,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:57,869 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 10:38:57,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:38:57,870 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 10:38:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:38:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-28 10:38:57,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:57,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2022-04-28 10:38:57,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 17 transitions. [2022-04-28 10:38:57,885 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-28 10:38:57,885 INFO L225 Difference]: With dead ends: 17 [2022-04-28 10:38:57,885 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:38:57,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:38:57,886 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:38:57,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:38:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:38:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:38:57,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:38:57,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:38:57,887 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:38:57,887 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:38:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:57,888 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:38:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:38:57,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:57,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:57,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:38:57,888 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:38:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:38:57,888 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:38:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:38:57,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:57,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:38:57,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:38:57,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:38:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:38:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:38:57,889 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-04-28 10:38:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:38:57,889 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:38:57,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:38:57,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:38:57,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:38:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:38:57,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:38:57,891 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:38:57,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:38:58,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 10:38:58,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:38:58,204 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 11) no Hoare annotation was computed. [2022-04-28 10:38:58,204 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 11) no Hoare annotation was computed. [2022-04-28 10:38:58,204 INFO L899 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2022-04-28 10:38:58,204 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 19 30) the Hoare annotation is: true [2022-04-28 10:38:58,204 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: (let ((.cse0 (<= 1 main_~i~0))) (or (and (<= main_~i~0 1) (<= 0 main_~c~0) .cse0) (and (<= 1 main_~c~0) .cse0))) [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 19 30) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point L22(line 22) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L895 garLoopResultBuilder]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse0 (+ main_~i~0 main_~c~0)) (.cse1 (<= 1 main_~i~0))) (or (and (<= main_~i~0 0) (<= 0 main_~i~0) (<= 0 .cse0)) (and (<= main_~i~0 1) (<= 1 .cse0) .cse1) (and (<= 1 main_~c~0) .cse1))) [2022-04-28 10:38:58,205 INFO L895 garLoopResultBuilder]: At program point L23-3(lines 23 27) the Hoare annotation is: (and (<= 1 main_~c~0) (<= 1 main_~i~0)) [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 19 30) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:38:58,205 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:38:58,206 INFO L895 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:38:58,206 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 10:38:58,206 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 18) the Hoare annotation is: true [2022-04-28 10:38:58,206 INFO L902 garLoopResultBuilder]: At program point L15-2(lines 14 18) the Hoare annotation is: true [2022-04-28 10:38:58,206 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 18) the Hoare annotation is: true [2022-04-28 10:38:58,206 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 10:38:58,208 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-28 10:38:58,209 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:38:58,211 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:38:58,211 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:38:58,214 WARN L170 areAnnotationChecker]: L11-1 has no Hoare annotation [2022-04-28 10:38:58,228 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:38:58,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:38:58 BoogieIcfgContainer [2022-04-28 10:38:58,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:38:58,241 INFO L158 Benchmark]: Toolchain (without parser) took 3257.33ms. Allocated memory is still 204.5MB. Free memory was 156.8MB in the beginning and 146.0MB in the end (delta: 10.8MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 10:38:58,241 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 204.5MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:38:58,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.84ms. Allocated memory is still 204.5MB. Free memory was 156.6MB in the beginning and 183.3MB in the end (delta: -26.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:38:58,242 INFO L158 Benchmark]: Boogie Preprocessor took 34.43ms. Allocated memory is still 204.5MB. Free memory was 183.3MB in the beginning and 181.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:38:58,242 INFO L158 Benchmark]: RCFGBuilder took 253.36ms. Allocated memory is still 204.5MB. Free memory was 181.7MB in the beginning and 171.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 10:38:58,242 INFO L158 Benchmark]: TraceAbstraction took 2774.91ms. Allocated memory is still 204.5MB. Free memory was 170.9MB in the beginning and 146.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. [2022-04-28 10:38:58,243 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.13ms. Allocated memory is still 204.5MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.84ms. Allocated memory is still 204.5MB. Free memory was 156.6MB in the beginning and 183.3MB in the end (delta: -26.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.43ms. Allocated memory is still 204.5MB. Free memory was 183.3MB in the beginning and 181.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 253.36ms. Allocated memory is still 204.5MB. Free memory was 181.7MB in the beginning and 171.3MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2774.91ms. Allocated memory is still 204.5MB. Free memory was 170.9MB in the beginning and 146.0MB in the end (delta: 24.9MB). Peak memory consumption was 25.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 56 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 39 PreInvPairs, 57 NumberOfFragments, 92 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((i <= 0 && 0 <= i) && 0 <= i + c) || ((i <= 1 && 1 <= i + c) && 1 <= i)) || (1 <= c && 1 <= i) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 10:38:58,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...