/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:06:59,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:06:59,774 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:06:59,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:06:59,801 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:06:59,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:06:59,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:06:59,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:06:59,815 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:06:59,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:06:59,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:06:59,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:06:59,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:06:59,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:06:59,824 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:06:59,825 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:06:59,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:06:59,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:06:59,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:06:59,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:06:59,836 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:06:59,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:06:59,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:06:59,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:06:59,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:06:59,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:06:59,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:06:59,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:06:59,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:06:59,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:06:59,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:06:59,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:06:59,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:06:59,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:06:59,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:06:59,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:06:59,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:06:59,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:06:59,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:06:59,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:06:59,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:06:59,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:06:59,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:06:59,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:06:59,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:06:59,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:06:59,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:06:59,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:06:59,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:06:59,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:06:59,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:06:59,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:06:59,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:06:59,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:06:59,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:06:59,860 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:06:59,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:06:59,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:06:59,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:06:59,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:06:59,862 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:06:59,862 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 06:07:00,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:07:00,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:07:00,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:07:00,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:07:00,142 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:07:00,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c [2022-04-15 06:07:00,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97694690d/f928e32baf37475b8e5d4e9e3a382631/FLAGf93539518 [2022-04-15 06:07:00,601 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:07:00,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c [2022-04-15 06:07:00,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97694690d/f928e32baf37475b8e5d4e9e3a382631/FLAGf93539518 [2022-04-15 06:07:00,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97694690d/f928e32baf37475b8e5d4e9e3a382631 [2022-04-15 06:07:00,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:07:00,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:07:00,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:07:00,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:07:00,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:07:00,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f1842d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00, skipping insertion in model container [2022-04-15 06:07:00,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:07:00,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:07:00,834 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-acceleration/underapprox_2-1.c[327,340] [2022-04-15 06:07:00,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:07:00,863 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:07:00,875 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-acceleration/underapprox_2-1.c[327,340] [2022-04-15 06:07:00,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:07:00,889 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:07:00,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00 WrapperNode [2022-04-15 06:07:00,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:07:00,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:07:00,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:07:00,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:07:00,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:07:00,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:07:00,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:07:00,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:07:00,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (1/1) ... [2022-04-15 06:07:00,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:07:00,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:00,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 06:07:01,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 06:07:01,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:07:01,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:07:01,048 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:07:01,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:07:01,048 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:07:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:07:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:07:01,048 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:07:01,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:07:01,107 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:07:01,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:07:01,263 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:07:01,268 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:07:01,269 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 06:07:01,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:07:01 BoogieIcfgContainer [2022-04-15 06:07:01,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:07:01,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:07:01,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:07:01,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:07:01,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:07:00" (1/3) ... [2022-04-15 06:07:01,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5c1178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:07:01, skipping insertion in model container [2022-04-15 06:07:01,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:07:00" (2/3) ... [2022-04-15 06:07:01,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b5c1178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:07:01, skipping insertion in model container [2022-04-15 06:07:01,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:07:01" (3/3) ... [2022-04-15 06:07:01,277 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_2-1.c [2022-04-15 06:07:01,281 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:07:01,281 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:07:01,322 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:07:01,328 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 06:07:01,328 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:07:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:07:01,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:07:01,361 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:01,361 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:01,362 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 06:07:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:01,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238491512] [2022-04-15 06:07:01,394 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:07:01,395 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 06:07:01,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:01,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034220491] [2022-04-15 06:07:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:01,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:01,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 06:07:01,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 06:07:01,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 06:07:01,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:01,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 06:07:01,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 06:07:01,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 06:07:01,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-15 06:07:01,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-15 06:07:01,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 06:07:01,577 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-15 06:07:01,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 06:07:01,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 06:07:01,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 06:07:01,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:01,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:01,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034220491] [2022-04-15 06:07:01,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034220491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:01,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:01,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:07:01,583 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:01,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238491512] [2022-04-15 06:07:01,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238491512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:01,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:01,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:07:01,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405987315] [2022-04-15 06:07:01,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:01,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:07:01,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:01,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:01,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:07:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:01,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:07:01,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:07:01,636 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:01,715 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 06:07:01,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:07:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 06:07:01,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:01,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 06:07:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 06:07:01,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 06:07:01,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:01,777 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:07:01,777 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 06:07:01,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:07:01,782 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:01,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:07:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 06:07:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 06:07:01,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:01,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,817 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,817 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:01,823 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 06:07:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 06:07:01,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:01,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:01,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-15 06:07:01,824 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 12 states. [2022-04-15 06:07:01,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:01,826 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 06:07:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 06:07:01,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:01,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:01,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:01,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 06:07:01,831 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 06:07:01,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:01,831 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 06:07:01,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:01,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 06:07:01,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 06:07:01,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 06:07:01,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:01,857 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:01,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:07:01,860 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:01,860 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 06:07:01,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:01,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [924056983] [2022-04-15 06:07:01,861 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:07:01,861 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 06:07:01,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:01,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440941316] [2022-04-15 06:07:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:01,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:01,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:01,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(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(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 06:07:01,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 06:07:01,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 06:07:01,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:01,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(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(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 06:07:01,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 06:07:01,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 06:07:01,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-15 06:07:01,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-15 06:07:01,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-15 06:07:01,982 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:07:01,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {142#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:01,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {142#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {136#false} is VALID [2022-04-15 06:07:01,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 06:07:02,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:02,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:02,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440941316] [2022-04-15 06:07:02,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440941316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:02,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:02,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:07:02,008 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:02,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [924056983] [2022-04-15 06:07:02,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [924056983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:02,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:02,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:07:02,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012216216] [2022-04-15 06:07:02,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:02,009 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-15 06:07:02,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:02,010 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-15 06:07:02,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,031 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:07:02,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:02,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:07:02,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:07:02,032 INFO L87 Difference]: Start difference. First operand 12 states and 12 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-15 06:07:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,099 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 06:07:02,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:07:02,100 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-15 06:07:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:02,100 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-15 06:07:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 06:07:02,101 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-15 06:07:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 06:07:02,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 06:07:02,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,119 INFO L225 Difference]: With dead ends: 18 [2022-04-15 06:07:02,119 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 06:07:02,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:07:02,121 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:02,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:07:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 06:07:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 06:07:02,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:02,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,125 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,126 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,127 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 06:07:02,127 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:07:02,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:02,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:02,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 06:07:02,128 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 06:07:02,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,130 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 06:07:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:07:02,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:02,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:02,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:02,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 06:07:02,132 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 06:07:02,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:02,133 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 06:07:02,134 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-15 06:07:02,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 06:07:02,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,146 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 06:07:02,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:07:02,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:02,147 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:02,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:07:02,147 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:02,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:02,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 06:07:02,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:02,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487571393] [2022-04-15 06:07:02,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:02,176 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:07:02,176 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:02,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-15 06:07:02,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:02,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540821296] [2022-04-15 06:07:02,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:02,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:02,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#(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(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-15 06:07:02,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-15 06:07:02,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-15 06:07:02,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:02,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#(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(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-15 06:07:02,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-15 06:07:02,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-15 06:07:02,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-15 06:07:02,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} ~x~0 := 0;~y~0 := 1; {241#(= main_~x~0 0)} is VALID [2022-04-15 06:07:02,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {242#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:07:02,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {237#false} is VALID [2022-04-15 06:07:02,314 INFO L272 TraceCheckUtils]: 8: Hoare triple {237#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:07:02,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {244#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:02,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {237#false} is VALID [2022-04-15 06:07:02,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-15 06:07:02,317 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-15 06:07:02,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540821296] [2022-04-15 06:07:02,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540821296] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306227511] [2022-04-15 06:07:02,318 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:07:02,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:02,322 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-15 06:07:02,323 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-15 06:07:02,357 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:07:02,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:02,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:07:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:02,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:02,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-15 06:07:02,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-15 06:07:02,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} ~x~0 := 0;~y~0 := 1; {241#(= main_~x~0 0)} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {267#(= main_~x~0 1)} is VALID [2022-04-15 06:07:02,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {237#false} is VALID [2022-04-15 06:07:02,452 INFO L272 TraceCheckUtils]: 8: Hoare triple {237#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {237#false} is VALID [2022-04-15 06:07:02,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-04-15 06:07:02,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-04-15 06:07:02,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-15 06:07:02,452 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-15 06:07:02,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:02,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-15 06:07:02,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {237#false} is VALID [2022-04-15 06:07:02,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {286#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:02,637 INFO L272 TraceCheckUtils]: 8: Hoare triple {294#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {290#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:02,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {294#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:02,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {294#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:02,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} ~x~0 := 0;~y~0 := 1; {301#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 06:07:02,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-15 06:07:02,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-15 06:07:02,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-15 06:07:02,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-15 06:07:02,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-15 06:07:02,640 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-15 06:07:02,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306227511] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:02,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:02,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 6] total 12 [2022-04-15 06:07:02,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:02,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487571393] [2022-04-15 06:07:02,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487571393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:02,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:02,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:07:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307624489] [2022-04-15 06:07:02,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:07:02,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:02,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:07:02,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:07:02,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:07:02,652 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,745 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 06:07:02,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:07:02,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 06:07:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 06:07:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 06:07:02,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 06:07:02,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,766 INFO L225 Difference]: With dead ends: 19 [2022-04-15 06:07:02,766 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:07:02,766 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:07:02,767 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:02,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:07:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:07:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:07:02,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:02,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,772 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,772 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,773 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:07:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:07:02,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:02,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:02,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 06:07:02,774 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 06:07:02,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,774 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 06:07:02,774 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:07:02,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:02,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:02,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:02,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 06:07:02,776 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 06:07:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:02,776 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 06:07:02,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:02,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 06:07:02,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 06:07:02,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:07:02,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:02,789 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:02,816 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-15 06:07:03,003 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-15 06:07:03,004 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-15 06:07:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:03,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1526544371] [2022-04-15 06:07:03,009 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:03,009 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:07:03,009 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-15 06:07:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:03,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665393605] [2022-04-15 06:07:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:03,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:03,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(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(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-15 06:07:03,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-15 06:07:03,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-15 06:07:03,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:03,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(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(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-15 06:07:03,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-15 06:07:03,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-15 06:07:03,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2022-04-15 06:07:03,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~x~0 := 0;~y~0 := 1; {425#(= main_~x~0 0)} is VALID [2022-04-15 06:07:03,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:03,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {427#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:03,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {421#false} is VALID [2022-04-15 06:07:03,153 INFO L272 TraceCheckUtils]: 9: Hoare triple {421#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:07:03,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:03,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {421#false} is VALID [2022-04-15 06:07:03,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-15 06:07:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:03,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665393605] [2022-04-15 06:07:03,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665393605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:03,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289905169] [2022-04-15 06:07:03,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:03,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:03,161 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-15 06:07:03,163 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-15 06:07:03,189 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:03,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:03,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:07:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:03,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:03,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2022-04-15 06:07:03,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-15 06:07:03,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-15 06:07:03,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-15 06:07:03,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2022-04-15 06:07:03,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~x~0 := 0;~y~0 := 1; {425#(= main_~x~0 0)} is VALID [2022-04-15 06:07:03,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:03,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:03,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {421#false} is VALID [2022-04-15 06:07:03,268 INFO L272 TraceCheckUtils]: 9: Hoare triple {421#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {421#false} is VALID [2022-04-15 06:07:03,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#false} ~cond := #in~cond; {421#false} is VALID [2022-04-15 06:07:03,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume 0 == ~cond; {421#false} is VALID [2022-04-15 06:07:03,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-15 06:07:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:03,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:03,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-15 06:07:03,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {421#false} is VALID [2022-04-15 06:07:03,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {474#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:03,395 INFO L272 TraceCheckUtils]: 9: Hoare triple {482#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {478#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:03,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {482#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:03,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {482#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:03,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {493#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {489#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 06:07:03,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~x~0 := 0;~y~0 := 1; {493#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-15 06:07:03,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2022-04-15 06:07:03,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-15 06:07:03,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-15 06:07:03,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-15 06:07:03,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2022-04-15 06:07:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:03,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289905169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:03,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:03,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 7] total 14 [2022-04-15 06:07:03,400 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:03,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1526544371] [2022-04-15 06:07:03,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1526544371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:03,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:03,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:07:03,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530407237] [2022-04-15 06:07:03,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:03,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:07:03,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:03,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:03,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:07:03,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:03,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:07:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:07:03,413 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:03,521 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 06:07:03,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:07:03,521 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 06:07:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 06:07:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 06:07:03,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 06:07:03,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:03,559 INFO L225 Difference]: With dead ends: 20 [2022-04-15 06:07:03,559 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:07:03,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:07:03,560 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:03,560 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:07:03,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:07:03,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:07:03,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:03,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,566 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,566 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:03,567 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:07:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:07:03,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:03,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:03,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:07:03,568 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 06:07:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:03,569 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 06:07:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:07:03,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:03,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:03,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:03,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:03,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 06:07:03,571 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 06:07:03,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:03,571 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 06:07:03,571 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:03,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 06:07:03,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 06:07:03,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:07:03,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:03,586 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:03,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:03,799 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 06:07:03,800 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:03,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-15 06:07:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:03,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1240796884] [2022-04-15 06:07:03,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:03,803 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:07:03,803 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-15 06:07:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:03,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987221762] [2022-04-15 06:07:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:03,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:03,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(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(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:07:03,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:07:03,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-15 06:07:03,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:03,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(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(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:07:03,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:07:03,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-15 06:07:03,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret5 := main(); {620#true} is VALID [2022-04-15 06:07:03,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 1; {625#(= main_~x~0 0)} is VALID [2022-04-15 06:07:03,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:03,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:03,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {628#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 06:07:03,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {621#false} is VALID [2022-04-15 06:07:03,921 INFO L272 TraceCheckUtils]: 10: Hoare triple {621#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:07:03,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {630#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:03,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {621#false} is VALID [2022-04-15 06:07:03,922 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-15 06:07:03,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:03,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:03,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987221762] [2022-04-15 06:07:03,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987221762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:03,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587268482] [2022-04-15 06:07:03,924 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:07:03,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:03,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:03,943 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-15 06:07:03,944 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-15 06:07:03,978 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 06:07:03,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:03,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:07:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:03,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:04,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-15 06:07:04,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#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(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:07:04,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:07:04,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-15 06:07:04,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret5 := main(); {620#true} is VALID [2022-04-15 06:07:04,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 1; {625#(= main_~x~0 0)} is VALID [2022-04-15 06:07:04,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:04,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:04,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {659#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 06:07:04,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {621#false} is VALID [2022-04-15 06:07:04,063 INFO L272 TraceCheckUtils]: 10: Hoare triple {621#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {621#false} is VALID [2022-04-15 06:07:04,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2022-04-15 06:07:04,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#false} assume 0 == ~cond; {621#false} is VALID [2022-04-15 06:07:04,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-15 06:07:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:04,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:04,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-15 06:07:04,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {621#false} is VALID [2022-04-15 06:07:04,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {682#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {678#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:04,258 INFO L272 TraceCheckUtils]: 10: Hoare triple {686#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {682#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:04,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {686#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:04,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {686#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:04,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {697#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {693#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 06:07:04,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {697#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-15 06:07:04,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 1; {701#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-15 06:07:04,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret5 := main(); {620#true} is VALID [2022-04-15 06:07:04,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-15 06:07:04,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-15 06:07:04,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#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(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-15 06:07:04,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-15 06:07:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:04,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587268482] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:04,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 16 [2022-04-15 06:07:04,263 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:04,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1240796884] [2022-04-15 06:07:04,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1240796884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:04,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:04,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:07:04,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922220428] [2022-04-15 06:07:04,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:04,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:04,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:04,276 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:07:04,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:04,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:07:04,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:07:04,277 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:04,476 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 06:07:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:07:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 06:07:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 06:07:04,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 06:07:04,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:04,499 INFO L225 Difference]: With dead ends: 21 [2022-04-15 06:07:04,499 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:07:04,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:07:04,500 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:04,500 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:07:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:07:04,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:07:04,514 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:04,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:04,515 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:04,515 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:04,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:04,516 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:07:04,516 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:07:04,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:04,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:04,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:07:04,516 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 06:07:04,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:04,517 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 06:07:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:07:04,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:04,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:04,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:04,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:04,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 06:07:04,518 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 06:07:04,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:04,519 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 06:07:04,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 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-15 06:07:04,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 06:07:04,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:04,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 06:07:04,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:07:04,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:04,532 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:04,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 06:07:04,745 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:04,746 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:04,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-15 06:07:04,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:04,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295706448] [2022-04-15 06:07:04,758 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:04,758 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:07:04,758 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-15 06:07:04,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:04,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253472959] [2022-04-15 06:07:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:04,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-15 06:07:04,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-15 06:07:04,907 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-15 06:07:04,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:04,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-15 06:07:04,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-15 06:07:04,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-15 06:07:04,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret5 := main(); {836#true} is VALID [2022-04-15 06:07:04,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} ~x~0 := 0;~y~0 := 1; {841#(= main_~x~0 0)} is VALID [2022-04-15 06:07:04,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:04,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:04,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 06:07:04,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {845#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 06:07:04,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {837#false} is VALID [2022-04-15 06:07:04,912 INFO L272 TraceCheckUtils]: 11: Hoare triple {837#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:07:04,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {847#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:04,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {847#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {837#false} is VALID [2022-04-15 06:07:04,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-15 06:07:04,915 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:04,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253472959] [2022-04-15 06:07:04,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253472959] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:04,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896179007] [2022-04-15 06:07:04,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:07:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:04,916 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-15 06:07:04,927 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-15 06:07:04,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:07:04,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:04,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:07:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:04,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:05,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-15 06:07:05,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#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(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-15 06:07:05,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-15 06:07:05,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-15 06:07:05,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret5 := main(); {836#true} is VALID [2022-04-15 06:07:05,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} ~x~0 := 0;~y~0 := 1; {841#(= main_~x~0 0)} is VALID [2022-04-15 06:07:05,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:05,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:05,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 06:07:05,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {879#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:05,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {837#false} is VALID [2022-04-15 06:07:05,050 INFO L272 TraceCheckUtils]: 11: Hoare triple {837#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {837#false} is VALID [2022-04-15 06:07:05,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#false} ~cond := #in~cond; {837#false} is VALID [2022-04-15 06:07:05,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#false} assume 0 == ~cond; {837#false} is VALID [2022-04-15 06:07:05,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-15 06:07:05,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:05,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:05,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-15 06:07:05,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {898#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {837#false} is VALID [2022-04-15 06:07:05,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {902#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:05,243 INFO L272 TraceCheckUtils]: 11: Hoare triple {906#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {902#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:05,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {906#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:05,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {906#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:05,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {913#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 06:07:05,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {917#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-15 06:07:05,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {921#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-15 06:07:05,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} ~x~0 := 0;~y~0 := 1; {925#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} is VALID [2022-04-15 06:07:05,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret5 := main(); {836#true} is VALID [2022-04-15 06:07:05,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-15 06:07:05,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-15 06:07:05,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#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(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-15 06:07:05,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-15 06:07:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:05,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896179007] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:05,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:05,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 18 [2022-04-15 06:07:05,249 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:05,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295706448] [2022-04-15 06:07:05,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295706448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:05,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:05,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:07:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865771079] [2022-04-15 06:07:05,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:05,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:07:05,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:05,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:05,269 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:07:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:07:05,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:07:05,270 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:05,491 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 06:07:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:07:05,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:07:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 06:07:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 06:07:05,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 06:07:05,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:05,512 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:07:05,512 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:07:05,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:07:05,513 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:05,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:07:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:07:05,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:07:05,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:05,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,528 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,528 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:05,529 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 06:07:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 06:07:05,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:05,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:05,530 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:07:05,530 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:07:05,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:05,531 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 06:07:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 06:07:05,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:05,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:05,531 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:05,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 06:07:05,532 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 06:07:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:05,532 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 06:07:05,533 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:05,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 06:07:05,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:05,547 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 06:07:05,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:07:05,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:05,547 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:05,568 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-15 06:07:05,748 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:05,748 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:05,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:05,748 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-15 06:07:05,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:05,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518211654] [2022-04-15 06:07:05,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:05,752 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:07:05,752 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-15 06:07:05,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:05,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014020425] [2022-04-15 06:07:05,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:05,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:05,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:05,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(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(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-15 06:07:05,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-15 06:07:05,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-15 06:07:05,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:05,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(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(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-15 06:07:05,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-15 06:07:05,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-15 06:07:05,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-15 06:07:05,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1073#(= main_~x~0 0)} is VALID [2022-04-15 06:07:05,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:05,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:05,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 06:07:05,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:05,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 06:07:05,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1069#false} is VALID [2022-04-15 06:07:05,913 INFO L272 TraceCheckUtils]: 12: Hoare triple {1069#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:07:05,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1080#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:05,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1069#false} is VALID [2022-04-15 06:07:05,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-15 06:07:05,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:05,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014020425] [2022-04-15 06:07:05,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014020425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:05,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670916581] [2022-04-15 06:07:05,915 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:05,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:05,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:05,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:05,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 06:07:05,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:05,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:05,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:07:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:05,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:06,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-15 06:07:06,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#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(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-15 06:07:06,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-15 06:07:06,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-15 06:07:06,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-15 06:07:06,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1073#(= main_~x~0 0)} is VALID [2022-04-15 06:07:06,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 06:07:06,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 06:07:06,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 06:07:06,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 06:07:06,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1115#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 06:07:06,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1069#false} is VALID [2022-04-15 06:07:06,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {1069#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {1069#false} is VALID [2022-04-15 06:07:06,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#false} ~cond := #in~cond; {1069#false} is VALID [2022-04-15 06:07:06,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#false} assume 0 == ~cond; {1069#false} is VALID [2022-04-15 06:07:06,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-15 06:07:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:06,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:06,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-15 06:07:06,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1069#false} is VALID [2022-04-15 06:07:06,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1134#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:07:06,261 INFO L272 TraceCheckUtils]: 12: Hoare triple {1142#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {1138#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:06,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1142#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {1142#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:06,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {1149#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1142#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-15 06:07:06,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {1153#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1149#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 06:07:06,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {1157#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1153#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-15 06:07:06,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1157#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-15 06:07:06,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#(not (= 6 (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1161#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} is VALID [2022-04-15 06:07:06,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1165#(not (= 6 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-15 06:07:06,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-15 06:07:06,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-15 06:07:06,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-15 06:07:06,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#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(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-15 06:07:06,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-15 06:07:06,277 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:07:06,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670916581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:06,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:06,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 20 [2022-04-15 06:07:06,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:06,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518211654] [2022-04-15 06:07:06,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518211654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:06,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:06,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:07:06,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637985184] [2022-04-15 06:07:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:06,278 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:07:06,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:06,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:06,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:07:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:06,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:07:06,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:07:06,293 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,516 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 06:07:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:07:06,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:07:06,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 06:07:06,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 06:07:06,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 06:07:06,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:06,543 INFO L225 Difference]: With dead ends: 23 [2022-04-15 06:07:06,544 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:07:06,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:07:06,546 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:06,546 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:07:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:07:06,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:07:06,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:06,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,557 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,557 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,558 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 06:07:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 06:07:06,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:06,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:06,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:07:06,558 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:07:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,559 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 06:07:06,559 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 06:07:06,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:06,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:06,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:06,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 06:07:06,560 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 06:07:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:06,560 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 06:07:06,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:07:06,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 06:07:06,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 06:07:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:07:06,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:06,574 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:06,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 06:07:06,774 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:06,775 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:06,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-15 06:07:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:06,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759376714] [2022-04-15 06:07:06,778 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:06,779 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 06:07:06,779 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-15 06:07:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:06,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680100107] [2022-04-15 06:07:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:06,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:06,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 06:07:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 06:07:06,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 06:07:06,835 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 06:07:06,835 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 06:07:06,836 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 06:07:06,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 06:07:06,840 INFO L719 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-15 06:07:06,842 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 06:07:06,849 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 06:07:06,850 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 06:07:06,850 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 06:07:06,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 06:07:06 BoogieIcfgContainer [2022-04-15 06:07:06,852 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 06:07:06,853 INFO L158 Benchmark]: Toolchain (without parser) took 6222.51ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 127.0MB in the beginning and 103.2MB in the end (delta: 23.8MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. [2022-04-15 06:07:06,853 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 175.1MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 06:07:06,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.39ms. Allocated memory is still 175.1MB. Free memory was 126.8MB in the beginning and 154.2MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 06:07:06,854 INFO L158 Benchmark]: Boogie Preprocessor took 32.85ms. Allocated memory is still 175.1MB. Free memory was 154.2MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 06:07:06,854 INFO L158 Benchmark]: RCFGBuilder took 344.99ms. Allocated memory is still 175.1MB. Free memory was 152.6MB in the beginning and 142.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 06:07:06,854 INFO L158 Benchmark]: TraceAbstraction took 5580.87ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 142.1MB in the beginning and 103.2MB in the end (delta: 38.9MB). Peak memory consumption was 75.3MB. Max. memory is 8.0GB. [2022-04-15 06:07:06,856 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.18ms. Allocated memory is still 175.1MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.39ms. Allocated memory is still 175.1MB. Free memory was 126.8MB in the beginning and 154.2MB in the end (delta: -27.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.85ms. Allocated memory is still 175.1MB. Free memory was 154.2MB in the beginning and 152.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 344.99ms. Allocated memory is still 175.1MB. Free memory was 152.6MB in the beginning and 142.6MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 5580.87ms. Allocated memory was 175.1MB in the beginning and 210.8MB in the end (delta: 35.7MB). Free memory was 142.1MB in the beginning and 103.2MB in the end (delta: 38.9MB). Peak memory consumption was 75.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 - CounterExampleResult [Line: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L13] unsigned int x = 0; [L14] unsigned int y = 1; [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND FALSE !(x < 6) [L21] CALL __VERIFIER_assert(x != 6) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 83 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 06:07:06,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...