/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-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:38:14,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:38:14,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:38:14,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:38:14,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:38:14,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:38:14,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:38:14,840 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:38:14,841 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:38:14,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:38:14,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:38:14,843 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:38:14,844 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:38:14,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:38:14,845 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:38:14,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:38:14,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:38:14,846 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:38:14,847 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:38:14,849 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:38:14,849 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:38:14,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:38:14,851 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:38:14,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:38:14,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:38:14,856 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:38:14,856 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:38:14,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:38:14,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:38:14,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:38:14,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:38:14,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:38:14,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:38:14,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:38:14,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:38:14,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:38:14,859 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:38:14,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:38:14,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:38:14,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:38:14,861 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:38:14,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:38:14,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:38:14,867 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:38:14,867 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:38:14,868 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:38:14,868 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:38:14,868 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:38:14,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:38:14,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:38:14,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:38:14,869 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:38:14,869 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:38:14,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:38:14,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:38:14,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:38:14,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:38:14,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:38:14,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:38:14,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:38:14,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:38:14,870 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:38:14,870 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:38:14,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:38:14,870 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:38:14,870 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-08 09:38:15,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:38:15,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:38:15,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:38:15,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:38:15,055 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:38:15,056 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-08 09:38:15,120 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a583c9456/8be0df96d2f1417fa021d9f5e9f31ff5/FLAGe0b601029 [2022-04-08 09:38:15,464 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:38:15,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2022-04-08 09:38:15,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a583c9456/8be0df96d2f1417fa021d9f5e9f31ff5/FLAGe0b601029 [2022-04-08 09:38:15,479 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a583c9456/8be0df96d2f1417fa021d9f5e9f31ff5 [2022-04-08 09:38:15,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:38:15,482 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:38:15,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:38:15,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:38:15,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:38:15,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c5f078 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15, skipping insertion in model container [2022-04-08 09:38:15,493 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,498 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:38:15,507 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:38:15,606 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-lit/gj2007b.i[895,908] [2022-04-08 09:38:15,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:38:15,619 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:38:15,659 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-lit/gj2007b.i[895,908] [2022-04-08 09:38:15,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:38:15,670 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:38:15,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15 WrapperNode [2022-04-08 09:38:15,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:38:15,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:38:15,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:38:15,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:38:15,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:38:15,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:38:15,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:38:15,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:38:15,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (1/1) ... [2022-04-08 09:38:15,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:38:15,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:38:15,744 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-08 09:38:15,748 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-08 09:38:15,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:38:15,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:38:15,767 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:38:15,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:38:15,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:38:15,768 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:38:15,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:38:15,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:38:15,813 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:38:15,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:38:15,897 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:38:15,902 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:38:15,902 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 09:38:15,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:38:15 BoogieIcfgContainer [2022-04-08 09:38:15,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:38:15,905 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:38:15,905 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:38:15,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:38:15,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:38:15" (1/3) ... [2022-04-08 09:38:15,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41134315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:38:15, skipping insertion in model container [2022-04-08 09:38:15,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:38:15" (2/3) ... [2022-04-08 09:38:15,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41134315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:38:15, skipping insertion in model container [2022-04-08 09:38:15,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:38:15" (3/3) ... [2022-04-08 09:38:15,914 INFO L111 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2022-04-08 09:38:15,917 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:38:15,917 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:38:15,989 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:38:15,994 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:38:15,994 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:38:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 09:38:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:38:16,010 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:16,011 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:16,011 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 1 times [2022-04-08 09:38:16,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:16,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1238709877] [2022-04-08 09:38:16,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:38:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash -915508507, now seen corresponding path program 2 times [2022-04-08 09:38:16,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:16,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082881256] [2022-04-08 09:38:16,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:16,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:16,188 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(9, 2); {25#true} is VALID [2022-04-08 09:38:16,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:38:16,189 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-08 09:38:16,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:16,191 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(9, 2); {25#true} is VALID [2022-04-08 09:38:16,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 09:38:16,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-08 09:38:16,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret3 := main(); {25#true} is VALID [2022-04-08 09:38:16,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-08 09:38:16,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 09:38:16,193 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {26#false} is VALID [2022-04-08 09:38:16,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 09:38:16,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 09:38:16,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 09:38:16,194 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-08 09:38:16,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:16,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082881256] [2022-04-08 09:38:16,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082881256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:16,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:16,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:38:16,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:16,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1238709877] [2022-04-08 09:38:16,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1238709877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:16,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:16,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 09:38:16,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093107711] [2022-04-08 09:38:16,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:16,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:38:16,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:16,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:16,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 09:38:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 09:38:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:38:16,242 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:16,307 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 09:38:16,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 09:38:16,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:38:16,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:16,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-08 09:38:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-08 09:38:16,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-08 09:38:16,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:16,382 INFO L225 Difference]: With dead ends: 35 [2022-04-08 09:38:16,382 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 09:38:16,384 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 09:38:16,389 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:16,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 09:38:16,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 09:38:16,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:16,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:16,424 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:16,425 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:16,431 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 09:38:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:38:16,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:16,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:16,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-08 09:38:16,433 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-08 09:38:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:16,437 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 09:38:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:38:16,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:16,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:16,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:16,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:16,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 09:38:16,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 09:38:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:16,441 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 09:38:16,442 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 09:38:16,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 09:38:16,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 09:38:16,470 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:16,470 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:16,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:38:16,470 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:16,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 1 times [2022-04-08 09:38:16,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:16,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1345478810] [2022-04-08 09:38:16,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:38:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -925667238, now seen corresponding path program 2 times [2022-04-08 09:38:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792496405] [2022-04-08 09:38:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:16,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(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(9, 2); {171#true} is VALID [2022-04-08 09:38:16,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-08 09:38:16,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#true} {171#true} #60#return; {171#true} is VALID [2022-04-08 09:38:16,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {171#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:16,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(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(9, 2); {171#true} is VALID [2022-04-08 09:38:16,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#true} assume true; {171#true} is VALID [2022-04-08 09:38:16,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#true} {171#true} #60#return; {171#true} is VALID [2022-04-08 09:38:16,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#true} call #t~ret3 := main(); {171#true} is VALID [2022-04-08 09:38:16,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 09:38:16,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 09:38:16,600 INFO L272 TraceCheckUtils]: 7: Hoare triple {176#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {177#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:16,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {177#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {178#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:16,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {178#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {172#false} is VALID [2022-04-08 09:38:16,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-04-08 09:38:16,601 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-08 09:38:16,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:16,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792496405] [2022-04-08 09:38:16,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792496405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:16,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:16,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:38:16,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:16,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1345478810] [2022-04-08 09:38:16,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1345478810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:16,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:16,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:38:16,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517906437] [2022-04-08 09:38:16,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:16,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:38:16,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:16,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:16,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:38:16,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:16,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:38:16,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:38:16,613 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:16,788 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-08 09:38:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:38:16,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 09:38:16,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 09:38:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 09:38:16,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-08 09:38:16,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:16,821 INFO L225 Difference]: With dead ends: 28 [2022-04-08 09:38:16,821 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 09:38:16,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:38:16,824 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:16,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:16,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 09:38:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-08 09:38:16,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:16,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:16,849 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:16,850 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:16,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:16,851 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 09:38:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 09:38:16,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:16,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:16,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 09:38:16,852 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-08 09:38:16,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:16,856 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 09:38:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 09:38:16,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:16,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:16,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:16,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.3125) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-08 09:38:16,858 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-04-08 09:38:16,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:16,859 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-08 09:38:16,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:16,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-08 09:38:16,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 09:38:16,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 09:38:16,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:16,881 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:16,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:38:16,881 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 1 times [2022-04-08 09:38:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:16,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486080472] [2022-04-08 09:38:16,905 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:38:16,905 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:38:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1147629988, now seen corresponding path program 2 times [2022-04-08 09:38:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:16,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914600356] [2022-04-08 09:38:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:16,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:16,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {357#(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(9, 2); {348#true} is VALID [2022-04-08 09:38:16,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-08 09:38:16,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-08 09:38:16,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {357#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:16,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#(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(9, 2); {348#true} is VALID [2022-04-08 09:38:16,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-08 09:38:16,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-08 09:38:16,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret3 := main(); {348#true} is VALID [2022-04-08 09:38:16,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {353#(= main_~x~0 0)} is VALID [2022-04-08 09:38:16,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {353#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {353#(= main_~x~0 0)} is VALID [2022-04-08 09:38:16,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 09:38:16,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} ~x~0 := 1 + ~x~0; {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 09:38:16,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} assume !(~x~0 < ~n~0); {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} is VALID [2022-04-08 09:38:16,986 INFO L272 TraceCheckUtils]: 10: Hoare triple {354#(or (<= 0 main_~m~0) (<= main_~n~0 0))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {355#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:16,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {356#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:16,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {349#false} is VALID [2022-04-08 09:38:16,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-08 09:38:16,999 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-08 09:38:17,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:17,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914600356] [2022-04-08 09:38:17,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914600356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:38:17,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364001957] [2022-04-08 09:38:17,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:38:17,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:17,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:38:17,002 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-08 09:38:17,023 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-08 09:38:17,040 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:38:17,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:38:17,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:38:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:17,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:38:17,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-08 09:38:17,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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(9, 2); {348#true} is VALID [2022-04-08 09:38:17,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-08 09:38:17,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-08 09:38:17,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret3 := main(); {348#true} is VALID [2022-04-08 09:38:17,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {376#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:17,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {376#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:17,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:17,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:17,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {383#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:17,163 INFO L272 TraceCheckUtils]: 10: Hoare triple {383#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:38:17,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:38:17,164 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-08 09:38:17,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-08 09:38:17,164 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-08 09:38:17,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:38:17,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-08 09:38:17,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-08 09:38:17,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:38:17,339 INFO L272 TraceCheckUtils]: 10: Hoare triple {383#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:38:17,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {383#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:17,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {383#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:17,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {383#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:17,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {376#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {376#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:17,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {376#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:17,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret3 := main(); {348#true} is VALID [2022-04-08 09:38:17,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #60#return; {348#true} is VALID [2022-04-08 09:38:17,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-08 09:38:17,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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(9, 2); {348#true} is VALID [2022-04-08 09:38:17,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-08 09:38:17,342 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-08 09:38:17,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364001957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:38:17,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:38:17,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2022-04-08 09:38:17,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:17,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486080472] [2022-04-08 09:38:17,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486080472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:17,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:17,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:38:17,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638145646] [2022-04-08 09:38:17,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:17,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:17,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,352 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-08 09:38:17,353 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:38:17,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:17,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:38:17,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:38:17,353 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:17,587 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-08 09:38:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:38:17,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 09:38:17,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-08 09:38:17,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-08 09:38:17,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:17,630 INFO L225 Difference]: With dead ends: 42 [2022-04-08 09:38:17,630 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 09:38:17,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-08 09:38:17,635 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:17,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 34 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:38:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 09:38:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2022-04-08 09:38:17,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:17,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:17,659 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:17,659 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:17,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:17,671 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 09:38:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 09:38:17,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:17,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:17,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-08 09:38:17,672 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-08 09:38:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:17,674 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 09:38:17,674 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-08 09:38:17,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:17,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:17,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:17,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 20 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:17,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-08 09:38:17,676 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 14 [2022-04-08 09:38:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:17,676 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-08 09:38:17,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 5 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-08 09:38:17,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-08 09:38:17,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:17,699 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 09:38:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 09:38:17,701 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:17,701 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:17,720 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-08 09:38:17,906 WARN L460 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-08 09:38:17,906 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:17,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1885482061, now seen corresponding path program 1 times [2022-04-08 09:38:17,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:17,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1405435915] [2022-04-08 09:38:17,907 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:38:17,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1885482061, now seen corresponding path program 2 times [2022-04-08 09:38:17,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:17,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873636379] [2022-04-08 09:38:17,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:17,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:17,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(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(9, 2); {673#true} is VALID [2022-04-08 09:38:17,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-08 09:38:17,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {673#true} {673#true} #60#return; {673#true} is VALID [2022-04-08 09:38:17,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-08 09:38:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:17,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {673#true} ~cond := #in~cond; {673#true} is VALID [2022-04-08 09:38:17,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {673#true} assume !(0 == ~cond); {673#true} is VALID [2022-04-08 09:38:17,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-08 09:38:17,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {673#true} {679#(<= main_~n~0 0)} #56#return; {679#(<= main_~n~0 0)} is VALID [2022-04-08 09:38:17,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {673#true} call ULTIMATE.init(); {686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:17,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {686#(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(9, 2); {673#true} is VALID [2022-04-08 09:38:17,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-08 09:38:17,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {673#true} {673#true} #60#return; {673#true} is VALID [2022-04-08 09:38:17,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {673#true} call #t~ret3 := main(); {673#true} is VALID [2022-04-08 09:38:17,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {673#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {678#(= main_~x~0 0)} is VALID [2022-04-08 09:38:17,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#(= main_~x~0 0)} assume !(~x~0 < ~n~0); {679#(<= main_~n~0 0)} is VALID [2022-04-08 09:38:17,999 INFO L272 TraceCheckUtils]: 7: Hoare triple {679#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {673#true} is VALID [2022-04-08 09:38:17,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {673#true} ~cond := #in~cond; {673#true} is VALID [2022-04-08 09:38:17,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {673#true} assume !(0 == ~cond); {673#true} is VALID [2022-04-08 09:38:17,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {673#true} assume true; {673#true} is VALID [2022-04-08 09:38:18,000 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {673#true} {679#(<= main_~n~0 0)} #56#return; {679#(<= main_~n~0 0)} is VALID [2022-04-08 09:38:18,001 INFO L272 TraceCheckUtils]: 12: Hoare triple {679#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {684#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:18,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {685#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:18,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {674#false} is VALID [2022-04-08 09:38:18,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {674#false} assume !false; {674#false} is VALID [2022-04-08 09:38:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:38:18,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873636379] [2022-04-08 09:38:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873636379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:18,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:18,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:38:18,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:18,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1405435915] [2022-04-08 09:38:18,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1405435915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:18,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:18,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:38:18,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298095720] [2022-04-08 09:38:18,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:18,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-08 09:38:18,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:18,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:18,017 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-08 09:38:18,017 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:38:18,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:18,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:38:18,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:38:18,018 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:18,176 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 09:38:18,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:38:18,176 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-08 09:38:18,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-08 09:38:18,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-08 09:38:18,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-08 09:38:18,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:18,202 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:38:18,202 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 09:38:18,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:38:18,203 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:18,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 09:38:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-08 09:38:18,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:18,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,213 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,213 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:18,214 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-08 09:38:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-08 09:38:18,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:18,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:18,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-08 09:38:18,215 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-08 09:38:18,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:18,216 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-08 09:38:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-04-08 09:38:18,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:18,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:18,216 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:18,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-08 09:38:18,217 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-04-08 09:38:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:18,218 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-08 09:38:18,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:18,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-08 09:38:18,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:18,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 09:38:18,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:38:18,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:18,245 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:18,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:38:18,245 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 820605978, now seen corresponding path program 3 times [2022-04-08 09:38:18,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1189579853] [2022-04-08 09:38:18,251 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:38:18,251 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:38:18,251 INFO L85 PathProgramCache]: Analyzing trace with hash 820605978, now seen corresponding path program 4 times [2022-04-08 09:38:18,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:18,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800218413] [2022-04-08 09:38:18,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:18,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:18,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:18,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {900#(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(9, 2); {890#true} is VALID [2022-04-08 09:38:18,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#true} assume true; {890#true} is VALID [2022-04-08 09:38:18,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {890#true} {890#true} #60#return; {890#true} is VALID [2022-04-08 09:38:18,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {890#true} call ULTIMATE.init(); {900#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:18,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#(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(9, 2); {890#true} is VALID [2022-04-08 09:38:18,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {890#true} assume true; {890#true} is VALID [2022-04-08 09:38:18,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {890#true} {890#true} #60#return; {890#true} is VALID [2022-04-08 09:38:18,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {890#true} call #t~ret3 := main(); {890#true} is VALID [2022-04-08 09:38:18,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {890#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {895#(= main_~x~0 0)} is VALID [2022-04-08 09:38:18,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {895#(= main_~x~0 0)} is VALID [2022-04-08 09:38:18,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {895#(= main_~x~0 0)} is VALID [2022-04-08 09:38:18,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {895#(= main_~x~0 0)} ~x~0 := 1 + ~x~0; {896#(<= 1 main_~x~0)} is VALID [2022-04-08 09:38:18,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {896#(<= 1 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {896#(<= 1 main_~x~0)} is VALID [2022-04-08 09:38:18,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {896#(<= 1 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {897#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:18,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {897#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {897#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:18,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {897#(<= 1 main_~m~0)} assume !(~x~0 < ~n~0); {897#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:18,309 INFO L272 TraceCheckUtils]: 13: Hoare triple {897#(<= 1 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {898#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:18,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {898#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {899#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:18,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {891#false} is VALID [2022-04-08 09:38:18,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#false} assume !false; {891#false} is VALID [2022-04-08 09:38:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:38:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:18,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800218413] [2022-04-08 09:38:18,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800218413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:38:18,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072179441] [2022-04-08 09:38:18,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 09:38:18,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:18,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:38:18,311 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-08 09:38:18,312 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-08 09:38:18,337 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 09:38:18,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:38:18,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:38:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:18,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:38:18,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {890#true} call ULTIMATE.init(); {890#true} is VALID [2022-04-08 09:38:18,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {890#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(9, 2); {890#true} is VALID [2022-04-08 09:38:18,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {890#true} assume true; {890#true} is VALID [2022-04-08 09:38:18,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {890#true} {890#true} #60#return; {890#true} is VALID [2022-04-08 09:38:18,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {890#true} call #t~ret3 := main(); {890#true} is VALID [2022-04-08 09:38:18,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {890#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {890#true} is VALID [2022-04-08 09:38:18,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {890#true} is VALID [2022-04-08 09:38:18,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#true} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {890#true} is VALID [2022-04-08 09:38:18,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {890#true} ~x~0 := 1 + ~x~0; {890#true} is VALID [2022-04-08 09:38:18,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {890#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {890#true} is VALID [2022-04-08 09:38:18,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#true} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {934#(<= main_~x~0 main_~m~0)} is VALID [2022-04-08 09:38:18,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {934#(<= main_~x~0 main_~m~0)} ~x~0 := 1 + ~x~0; {938#(<= main_~x~0 (+ main_~m~0 1))} is VALID [2022-04-08 09:38:18,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(<= main_~x~0 (+ main_~m~0 1))} assume !(~x~0 < ~n~0); {942#(<= main_~n~0 (+ main_~m~0 1))} is VALID [2022-04-08 09:38:18,606 INFO L272 TraceCheckUtils]: 13: Hoare triple {942#(<= main_~n~0 (+ main_~m~0 1))} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {946#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:38:18,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {946#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {950#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:38:18,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {891#false} is VALID [2022-04-08 09:38:18,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {891#false} assume !false; {891#false} is VALID [2022-04-08 09:38:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:38:18,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:38:18,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072179441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:18,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:38:18,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-04-08 09:38:18,607 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:18,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1189579853] [2022-04-08 09:38:18,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1189579853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:18,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:18,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:38:18,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851887604] [2022-04-08 09:38:18,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:18,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:38:18,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:18,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 09:38:18,617 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-08 09:38:18,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:38:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:38:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:38:18,618 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 09:38:18,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:18,787 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-04-08 09:38:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:38:18,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:38:18,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 09:38:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 09:38:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 09:38:18,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2022-04-08 09:38:18,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2022-04-08 09:38:18,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:18,819 INFO L225 Difference]: With dead ends: 48 [2022-04-08 09:38:18,819 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 09:38:18,820 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-08 09:38:18,821 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:18,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 09:38:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2022-04-08 09:38:18,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:18,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,845 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,846 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:18,848 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 09:38:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 09:38:18,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:18,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:18,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-08 09:38:18,850 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 46 states. [2022-04-08 09:38:18,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:18,853 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-08 09:38:18,853 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-08 09:38:18,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:18,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:18,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:18,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 09:38:18,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-08 09:38:18,857 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 17 [2022-04-08 09:38:18,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:18,857 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-08 09:38:18,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 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-08 09:38:18,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-08 09:38:18,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 09:38:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:38:18,887 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:18,887 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:18,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 09:38:19,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:19,099 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1672024233, now seen corresponding path program 1 times [2022-04-08 09:38:19,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:19,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950019079] [2022-04-08 09:38:19,105 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:38:19,106 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:38:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1672024233, now seen corresponding path program 2 times [2022-04-08 09:38:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:19,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429028967] [2022-04-08 09:38:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1219#(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(9, 2); {1206#true} is VALID [2022-04-08 09:38:19,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-08 09:38:19,160 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1206#true} {1206#true} #60#return; {1206#true} is VALID [2022-04-08 09:38:19,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 09:38:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#true} ~cond := #in~cond; {1206#true} is VALID [2022-04-08 09:38:19,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#true} assume !(0 == ~cond); {1206#true} is VALID [2022-04-08 09:38:19,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-08 09:38:19,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1206#true} {1212#(= main_~m~0 0)} #56#return; {1212#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {1206#true} call ULTIMATE.init(); {1219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:19,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1219#(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(9, 2); {1206#true} is VALID [2022-04-08 09:38:19,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-08 09:38:19,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1206#true} {1206#true} #60#return; {1206#true} is VALID [2022-04-08 09:38:19,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {1206#true} call #t~ret3 := main(); {1206#true} is VALID [2022-04-08 09:38:19,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1206#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1211#(= main_~x~0 0)} is VALID [2022-04-08 09:38:19,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1211#(= main_~x~0 0)} is VALID [2022-04-08 09:38:19,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1212#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {1212#(= main_~m~0 0)} ~x~0 := 1 + ~x~0; {1212#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {1212#(= main_~m~0 0)} assume !(~x~0 < ~n~0); {1212#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,182 INFO L272 TraceCheckUtils]: 10: Hoare triple {1212#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1206#true} is VALID [2022-04-08 09:38:19,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {1206#true} ~cond := #in~cond; {1206#true} is VALID [2022-04-08 09:38:19,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {1206#true} assume !(0 == ~cond); {1206#true} is VALID [2022-04-08 09:38:19,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-08 09:38:19,183 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1206#true} {1212#(= main_~m~0 0)} #56#return; {1212#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,183 INFO L272 TraceCheckUtils]: 15: Hoare triple {1212#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1217#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:19,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1218#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:19,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {1218#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1207#false} is VALID [2022-04-08 09:38:19,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2022-04-08 09:38:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:38:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:19,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429028967] [2022-04-08 09:38:19,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429028967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:38:19,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028284569] [2022-04-08 09:38:19,185 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:38:19,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:19,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:38:19,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:38:19,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 09:38:19,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:38:19,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:38:19,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 09:38:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:38:19,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {1206#true} call ULTIMATE.init(); {1206#true} is VALID [2022-04-08 09:38:19,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#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(9, 2); {1206#true} is VALID [2022-04-08 09:38:19,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-08 09:38:19,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1206#true} {1206#true} #60#return; {1206#true} is VALID [2022-04-08 09:38:19,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {1206#true} call #t~ret3 := main(); {1206#true} is VALID [2022-04-08 09:38:19,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1206#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1206#true} is VALID [2022-04-08 09:38:19,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {1206#true} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1241#(< main_~x~0 main_~n~0)} is VALID [2022-04-08 09:38:19,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1241#(< main_~x~0 main_~n~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-08 09:38:19,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {1245#(< main_~m~0 main_~n~0)} ~x~0 := 1 + ~x~0; {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-08 09:38:19,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1245#(< main_~m~0 main_~n~0)} assume !(~x~0 < ~n~0); {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-08 09:38:19,357 INFO L272 TraceCheckUtils]: 10: Hoare triple {1245#(< main_~m~0 main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1206#true} is VALID [2022-04-08 09:38:19,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {1206#true} ~cond := #in~cond; {1206#true} is VALID [2022-04-08 09:38:19,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {1206#true} assume !(0 == ~cond); {1206#true} is VALID [2022-04-08 09:38:19,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {1206#true} assume true; {1206#true} is VALID [2022-04-08 09:38:19,358 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1206#true} {1245#(< main_~m~0 main_~n~0)} #56#return; {1245#(< main_~m~0 main_~n~0)} is VALID [2022-04-08 09:38:19,359 INFO L272 TraceCheckUtils]: 15: Hoare triple {1245#(< main_~m~0 main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:38:19,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {1270#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1274#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:38:19,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1207#false} is VALID [2022-04-08 09:38:19,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {1207#false} assume !false; {1207#false} is VALID [2022-04-08 09:38:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:38:19,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 09:38:19,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028284569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:19,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 09:38:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-04-08 09:38:19,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:19,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950019079] [2022-04-08 09:38:19,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950019079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:19,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:19,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:38:19,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371974129] [2022-04-08 09:38:19,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:19,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-08 09:38:19,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:19,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:19,371 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:38:19,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:38:19,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-04-08 09:38:19,371 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:19,497 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-08 09:38:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:38:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-08 09:38:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:19,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 09:38:19,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-08 09:38:19,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-08 09:38:19,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:19,522 INFO L225 Difference]: With dead ends: 40 [2022-04-08 09:38:19,522 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 09:38:19,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:38:19,523 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:19,523 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:19,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 09:38:19,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-08 09:38:19,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:19,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,560 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,560 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:19,561 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 09:38:19,561 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 09:38:19,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:19,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:19,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 09:38:19,561 INFO L87 Difference]: Start difference. First operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-08 09:38:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:19,562 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-08 09:38:19,562 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 09:38:19,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:19,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:19,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:19,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:19,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-08 09:38:19,564 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-04-08 09:38:19,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:19,564 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-08 09:38:19,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-08 09:38:19,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-08 09:38:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 09:38:19,599 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:19,599 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:19,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 09:38:19,817 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:19,818 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:19,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:19,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1930189671, now seen corresponding path program 1 times [2022-04-08 09:38:19,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:19,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223864064] [2022-04-08 09:38:19,823 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:38:19,823 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:38:19,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1930189671, now seen corresponding path program 2 times [2022-04-08 09:38:19,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:19,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043391861] [2022-04-08 09:38:19,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:19,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {1496#(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(9, 2); {1484#true} is VALID [2022-04-08 09:38:19,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-08 09:38:19,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1484#true} {1484#true} #60#return; {1484#true} is VALID [2022-04-08 09:38:19,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-08 09:38:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:19,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-08 09:38:19,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-08 09:38:19,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-08 09:38:19,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1489#(= main_~m~0 0)} #56#return; {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:19,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {1496#(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(9, 2); {1484#true} is VALID [2022-04-08 09:38:19,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-08 09:38:19,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #60#return; {1484#true} is VALID [2022-04-08 09:38:19,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret3 := main(); {1484#true} is VALID [2022-04-08 09:38:19,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {1489#(= main_~m~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {1489#(= main_~m~0 0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {1489#(= main_~m~0 0)} ~x~0 := 1 + ~x~0; {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1489#(= main_~m~0 0)} assume !(~x~0 < ~n~0); {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,871 INFO L272 TraceCheckUtils]: 10: Hoare triple {1489#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1484#true} is VALID [2022-04-08 09:38:19,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-08 09:38:19,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-08 09:38:19,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-08 09:38:19,872 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1484#true} {1489#(= main_~m~0 0)} #56#return; {1489#(= main_~m~0 0)} is VALID [2022-04-08 09:38:19,872 INFO L272 TraceCheckUtils]: 15: Hoare triple {1489#(= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1494#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:19,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {1494#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1495#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:19,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {1495#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1485#false} is VALID [2022-04-08 09:38:19,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-08 09:38:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 09:38:19,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:19,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043391861] [2022-04-08 09:38:19,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043391861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:19,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:19,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:38:19,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:19,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223864064] [2022-04-08 09:38:19,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223864064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:19,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:19,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:38:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905947983] [2022-04-08 09:38:19,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:19,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-08 09:38:19,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:19,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:19,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:19,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:38:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:38:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:38:19,888 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:20,015 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 09:38:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 09:38:20,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-04-08 09:38:20,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 09:38:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 09:38:20,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-08 09:38:20,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:20,041 INFO L225 Difference]: With dead ends: 34 [2022-04-08 09:38:20,041 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 09:38:20,041 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-08 09:38:20,042 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:20,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 34 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:20,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 09:38:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-08 09:38:20,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:20,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,060 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,060 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:20,061 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 09:38:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 09:38:20,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:20,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:20,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 09:38:20,061 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 09:38:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:20,062 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-08 09:38:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 09:38:20,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:20,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:20,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:20,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-08 09:38:20,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2022-04-08 09:38:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:20,063 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-08 09:38:20,063 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:38:20,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-08 09:38:20,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:20,081 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-08 09:38:20,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 09:38:20,082 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:38:20,082 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:38:20,082 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 09:38:20,082 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:38:20,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:38:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1209158758, now seen corresponding path program 1 times [2022-04-08 09:38:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:20,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447349631] [2022-04-08 09:38:20,090 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 09:38:20,090 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 09:38:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1209158758, now seen corresponding path program 2 times [2022-04-08 09:38:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:38:20,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213141728] [2022-04-08 09:38:20,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:38:20,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:38:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:38:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:20,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {1674#(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(9, 2); {1664#true} is VALID [2022-04-08 09:38:20,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 09:38:20,142 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-08 09:38:20,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:38:20,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1674#(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(9, 2); {1664#true} is VALID [2022-04-08 09:38:20,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 09:38:20,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-08 09:38:20,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret3 := main(); {1664#true} is VALID [2022-04-08 09:38:20,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1669#(= main_~x~0 0)} is VALID [2022-04-08 09:38:20,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(= main_~x~0 0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1669#(= main_~x~0 0)} is VALID [2022-04-08 09:38:20,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {1669#(= main_~x~0 0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1669#(= main_~x~0 0)} is VALID [2022-04-08 09:38:20,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {1669#(= main_~x~0 0)} ~x~0 := 1 + ~x~0; {1670#(<= 1 main_~x~0)} is VALID [2022-04-08 09:38:20,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= 1 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1670#(<= 1 main_~x~0)} is VALID [2022-04-08 09:38:20,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(<= 1 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(<= 1 main_~m~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(<= 1 main_~m~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {1671#(<= 1 main_~m~0)} assume !(~x~0 < ~n~0); {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,147 INFO L272 TraceCheckUtils]: 16: Hoare triple {1671#(<= 1 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1672#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:38:20,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {1672#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1673#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:38:20,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {1673#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 09:38:20,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 09:38:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:38:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:38:20,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213141728] [2022-04-08 09:38:20,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213141728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 09:38:20,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502788362] [2022-04-08 09:38:20,149 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 09:38:20,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:38:20,150 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 09:38:20,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 09:38:20,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 09:38:20,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 09:38:20,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-08 09:38:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:38:20,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 09:38:20,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-08 09:38:20,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#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(9, 2); {1664#true} is VALID [2022-04-08 09:38:20,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 09:38:20,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-08 09:38:20,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret3 := main(); {1664#true} is VALID [2022-04-08 09:38:20,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1693#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:20,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {1693#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1693#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:20,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {1693#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1693#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:20,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {1693#(<= 0 main_~x~0)} ~x~0 := 1 + ~x~0; {1670#(<= 1 main_~x~0)} is VALID [2022-04-08 09:38:20,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {1670#(<= 1 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1670#(<= 1 main_~x~0)} is VALID [2022-04-08 09:38:20,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {1670#(<= 1 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {1671#(<= 1 main_~m~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {1671#(<= 1 main_~m~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {1671#(<= 1 main_~m~0)} ~x~0 := 1 + ~x~0; {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {1671#(<= 1 main_~m~0)} assume !(~x~0 < ~n~0); {1671#(<= 1 main_~m~0)} is VALID [2022-04-08 09:38:20,318 INFO L272 TraceCheckUtils]: 16: Hoare triple {1671#(<= 1 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:38:20,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:38:20,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 09:38:20,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 09:38:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:38:20,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 09:38:20,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2022-04-08 09:38:20,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1665#false} is VALID [2022-04-08 09:38:20,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 09:38:20,450 INFO L272 TraceCheckUtils]: 16: Hoare triple {1747#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 09:38:20,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {1747#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {1747#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:20,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {1747#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {1747#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:20,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1747#(<= 0 main_~m~0)} assume !(0 != #t~nondet2);havoc #t~nondet2; {1747#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:20,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {1747#(<= 0 main_~m~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1747#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:20,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {1747#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {1747#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:20,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {1693#(<= 0 main_~x~0)} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1747#(<= 0 main_~m~0)} is VALID [2022-04-08 09:38:20,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {1693#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1693#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:20,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1772#(<= 0 (+ main_~x~0 1))} ~x~0 := 1 + ~x~0; {1693#(<= 0 main_~x~0)} is VALID [2022-04-08 09:38:20,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1772#(<= 0 (+ main_~x~0 1))} assume 0 != #t~nondet2;havoc #t~nondet2;~m~0 := ~x~0; {1772#(<= 0 (+ main_~x~0 1))} is VALID [2022-04-08 09:38:20,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1772#(<= 0 (+ main_~x~0 1))} assume !!(~x~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1772#(<= 0 (+ main_~x~0 1))} is VALID [2022-04-08 09:38:20,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1664#true} ~x~0 := 0;~m~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~n~0 := #t~nondet1;havoc #t~nondet1; {1772#(<= 0 (+ main_~x~0 1))} is VALID [2022-04-08 09:38:20,472 INFO L272 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret3 := main(); {1664#true} is VALID [2022-04-08 09:38:20,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #60#return; {1664#true} is VALID [2022-04-08 09:38:20,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2022-04-08 09:38:20,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {1664#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(9, 2); {1664#true} is VALID [2022-04-08 09:38:20,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2022-04-08 09:38:20,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 09:38:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502788362] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 09:38:20,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 09:38:20,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-08 09:38:20,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:38:20,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447349631] [2022-04-08 09:38:20,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447349631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:38:20,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:38:20,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 09:38:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010752656] [2022-04-08 09:38:20,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:38:20,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:38:20,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:38:20,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:20,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 09:38:20,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:38:20,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 09:38:20,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-08 09:38:20,488 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:20,624 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 09:38:20,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:38:20,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 09:38:20,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:38:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-08 09:38:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2022-04-08 09:38:20,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2022-04-08 09:38:20,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:38:20,657 INFO L225 Difference]: With dead ends: 22 [2022-04-08 09:38:20,657 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:38:20,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-08 09:38:20,658 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 09:38:20,658 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 09:38:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:38:20,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:38:20,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:38:20,659 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-08 09:38:20,659 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-08 09:38:20,659 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-08 09:38:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:20,659 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:38:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:38:20,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:20,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:20,659 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-08 09:38:20,659 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-08 09:38:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:38:20,659 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:38:20,659 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:38:20,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:20,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:38:20,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:38:20,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:38:20,660 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-08 09:38:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:38:20,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-04-08 09:38:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:38:20,660 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:38:20,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:38:20,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:38:20,660 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-08 09:38:20,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:38:20,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:38:20,662 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:38:20,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 09:38:20,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 09:38:20,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:38:21,301 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:38:21,301 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:38:21,302 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:38:21,302 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:38:21,302 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:38:21,302 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:38:21,302 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:38:21,302 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 37) the Hoare annotation is: true [2022-04-08 09:38:21,302 INFO L878 garLoopResultBuilder]: At program point L29(lines 29 31) the Hoare annotation is: (let ((.cse0 (< main_~x~0 main_~n~0))) (or (and (= main_~x~0 0) .cse0 (= main_~m~0 0)) (and (<= 0 main_~m~0) (<= 1 main_~x~0) .cse0 (< main_~m~0 main_~n~0)))) [2022-04-08 09:38:21,302 INFO L878 garLoopResultBuilder]: At program point L29-2(lines 29 31) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (< main_~x~0 main_~n~0))) (or (and .cse1 (< main_~m~0 main_~n~0) (or (<= 0 main_~m~0) (<= main_~n~0 0))) (and .cse1 (= main_~m~0 0)))))) (or (and (= main_~x~0 0) .cse0) (and (<= 1 main_~x~0) .cse0))) [2022-04-08 09:38:21,302 INFO L878 garLoopResultBuilder]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (= main_~m~0 0))) (or (and (<= 1 main_~x~0) (or (and (< main_~m~0 main_~n~0) (or (<= 0 main_~m~0) (<= main_~n~0 0))) .cse0)) (and (= main_~x~0 0) .cse0))) [2022-04-08 09:38:21,302 INFO L878 garLoopResultBuilder]: At program point L28-3(lines 28 33) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 0))) (or (and (< main_~m~0 main_~n~0) (or (<= 0 main_~m~0) .cse0)) (and (= main_~x~0 0) .cse0) (= main_~m~0 0))) [2022-04-08 09:38:21,302 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 37) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 37) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (or (< main_~m~0 main_~n~0) (and (= main_~x~0 0) (<= main_~n~0 0)) (= main_~m~0 0)) [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L878 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-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:38:21,303 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:38:21,303 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:38:21,303 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:38:21,304 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:38:21,304 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (and (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0)))) [2022-04-08 09:38:21,306 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2, 2, 2] [2022-04-08 09:38:21,307 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:38:21,309 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:38:21,309 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:38:21,315 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:38:21,316 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:38:21,316 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:38:21,316 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:38:21,322 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:38:21,329 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:38:21,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:38:21 BoogieIcfgContainer [2022-04-08 09:38:21,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:38:21,336 INFO L158 Benchmark]: Toolchain (without parser) took 5853.79ms. Allocated memory was 190.8MB in the beginning and 312.5MB in the end (delta: 121.6MB). Free memory was 133.7MB in the beginning and 240.8MB in the end (delta: -107.1MB). Peak memory consumption was 122.3MB. Max. memory is 8.0GB. [2022-04-08 09:38:21,336 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:38:21,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.63ms. Allocated memory was 190.8MB in the beginning and 260.0MB in the end (delta: 69.2MB). Free memory was 133.5MB in the beginning and 233.3MB in the end (delta: -99.9MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-04-08 09:38:21,336 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 260.0MB. Free memory was 233.3MB in the beginning and 231.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 09:38:21,337 INFO L158 Benchmark]: RCFGBuilder took 198.16ms. Allocated memory is still 260.0MB. Free memory was 231.8MB in the beginning and 220.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 09:38:21,337 INFO L158 Benchmark]: TraceAbstraction took 5429.77ms. Allocated memory was 260.0MB in the beginning and 312.5MB in the end (delta: 52.4MB). Free memory was 219.2MB in the beginning and 241.3MB in the end (delta: -22.1MB). Peak memory consumption was 139.3MB. Max. memory is 8.0GB. [2022-04-08 09:38:21,338 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.11ms. Allocated memory is still 190.8MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.63ms. Allocated memory was 190.8MB in the beginning and 260.0MB in the end (delta: 69.2MB). Free memory was 133.5MB in the beginning and 233.3MB in the end (delta: -99.9MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 260.0MB. Free memory was 233.3MB in the beginning and 231.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 198.16ms. Allocated memory is still 260.0MB. Free memory was 231.8MB in the beginning and 220.1MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5429.77ms. Allocated memory was 260.0MB in the beginning and 312.5MB in the end (delta: 52.4MB). Free memory was 219.2MB in the beginning and 241.3MB in the end (delta: -22.1MB). Peak memory consumption was 139.3MB. 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: 19]: 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 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 160 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 333 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 381 IncrementalHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 120 mSDtfsCounter, 381 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 194 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=6, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 35 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 70 PreInvPairs, 114 NumberOfFragments, 197 HoareAnnotationTreeSize, 70 FomulaSimplifications, 192 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1194 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 28]: Loop Invariant Derived loop invariant: (1 <= x && ((m < n && (0 <= m || n <= 0)) || m == 0)) || (x == 0 && m == 0) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 09:38:21,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...