/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:46:50,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:46:50,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:46:50,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:46:50,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:46:50,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:46:50,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:46:50,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:46:50,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:46:50,809 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:46:50,810 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:46:50,811 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:46:50,811 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:46:50,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:46:50,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:46:50,817 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:46:50,818 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:46:50,818 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:46:50,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:46:50,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:46:50,827 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:46:50,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:46:50,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:46:50,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:46:50,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:46:50,837 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:46:50,837 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:46:50,838 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:46:50,838 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:46:50,839 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:46:50,840 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:46:50,840 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:46:50,842 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:46:50,842 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:46:50,843 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:46:50,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:46:50,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:46:50,844 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:46:50,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:46:50,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:46:50,845 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:46:50,847 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:46:50,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:46:50,856 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:46:50,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:46:50,857 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:46:50,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:46:50,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:46:50,858 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:46:50,858 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:46:50,858 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:46:50,858 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:46:50,859 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:46:50,859 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:46:50,859 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:50,860 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:46:50,860 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:46:50,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:46:50,861 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:46:50,861 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:46:51,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:46:51,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:46:51,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:46:51,133 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:46:51,135 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:46:51,136 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-15 12:46:51,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffd46a67d/9a5b2be2e73549848169f8999e895d9a/FLAGc3054dec4 [2022-04-15 12:46:51,619 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:46:51,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c [2022-04-15 12:46:51,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffd46a67d/9a5b2be2e73549848169f8999e895d9a/FLAGc3054dec4 [2022-04-15 12:46:52,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffd46a67d/9a5b2be2e73549848169f8999e895d9a [2022-04-15 12:46:52,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:46:52,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:46:52,038 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:52,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:46:52,042 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:46:52,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246d9ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52, skipping insertion in model container [2022-04-15 12:46:52,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:46:52,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:46:52,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-15 12:46:52,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:52,229 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:46:52,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono6_1.c[311,324] [2022-04-15 12:46:52,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:52,267 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:46:52,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52 WrapperNode [2022-04-15 12:46:52,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:52,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:46:52,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:46:52,269 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:46:52,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,301 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:46:52,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:46:52,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:46:52,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:46:52,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (1/1) ... [2022-04-15 12:46:52,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:52,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:46:52,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:46:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:46:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:46:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:46:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:46:52,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:46:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:46:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:46:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:46:52,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:46:52,408 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:46:52,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:46:52,583 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:46:52,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:46:52,589 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:46:52,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:52 BoogieIcfgContainer [2022-04-15 12:46:52,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:46:52,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:46:52,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:46:52,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:46:52,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:46:52" (1/3) ... [2022-04-15 12:46:52,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2195bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:52, skipping insertion in model container [2022-04-15 12:46:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:52" (2/3) ... [2022-04-15 12:46:52,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2195bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:52, skipping insertion in model container [2022-04-15 12:46:52,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:52" (3/3) ... [2022-04-15 12:46:52,612 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono6_1.c [2022-04-15 12:46:52,616 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:46:52,617 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:46:52,686 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:46:52,705 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:46:52,705 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:46:52,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:46:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:52,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:52,740 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:52,741 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:52,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 1 times [2022-04-15 12:46:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:52,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726350154] [2022-04-15 12:46:52,776 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:52,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2135496849, now seen corresponding path program 2 times [2022-04-15 12:46:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:52,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314024575] [2022-04-15 12:46:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:52,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:52,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:52,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 12:46:52,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:46:52,978 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 12:46:52,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:52,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 12:46:52,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:46:52,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #42#return; {24#true} is VALID [2022-04-15 12:46:52,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID [2022-04-15 12:46:52,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {24#true} is VALID [2022-04-15 12:46:52,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 12:46:52,983 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {25#false} is VALID [2022-04-15 12:46:52,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 12:46:52,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 12:46:52,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 12:46:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:52,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:52,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314024575] [2022-04-15 12:46:52,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314024575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:52,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:52,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:52,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726350154] [2022-04-15 12:46:52,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726350154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:52,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:52,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:52,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906678025] [2022-04-15 12:46:52,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:52,999 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:53,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:53,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,026 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:46:53,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:53,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:46:53,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:53,056 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:53,154 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 12:46:53,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:46:53,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 12:46:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-15 12:46:53,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-15 12:46:53,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,261 INFO L225 Difference]: With dead ends: 33 [2022-04-15 12:46:53,261 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:46:53,264 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:53,271 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:53,273 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:46:53,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:46:53,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:53,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 12:46:53,302 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 12:46:53,302 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 12:46:53,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:53,304 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 12:46:53,304 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:46:53,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:53,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:53,305 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-15 12:46:53,305 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 14 states. [2022-04-15 12:46:53,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:53,308 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-15 12:46:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:46:53,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:53,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:53,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:53,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 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 12:46:53,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 12:46:53,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 12:46:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:53,312 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 12:46:53,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 12:46:53,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,329 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:46:53,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:53,329 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:53,329 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:53,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:46:53,333 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:53,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:53,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 1 times [2022-04-15 12:46:53,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:53,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069745633] [2022-04-15 12:46:53,342 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash -2145655580, now seen corresponding path program 2 times [2022-04-15 12:46:53,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:53,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557870956] [2022-04-15 12:46:53,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:53,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 12:46:53,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 12:46:53,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 12:46:53,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {154#true} call ULTIMATE.init(); {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:53,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {160#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {154#true} is VALID [2022-04-15 12:46:53,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume true; {154#true} is VALID [2022-04-15 12:46:53,472 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {154#true} {154#true} #42#return; {154#true} is VALID [2022-04-15 12:46:53,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {154#true} call #t~ret6 := main(); {154#true} is VALID [2022-04-15 12:46:53,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {154#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {159#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:53,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {159#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {155#false} is VALID [2022-04-15 12:46:53,474 INFO L272 TraceCheckUtils]: 7: Hoare triple {155#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {155#false} is VALID [2022-04-15 12:46:53,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {155#false} ~cond := #in~cond; {155#false} is VALID [2022-04-15 12:46:53,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {155#false} assume 0 == ~cond; {155#false} is VALID [2022-04-15 12:46:53,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {155#false} assume !false; {155#false} is VALID [2022-04-15 12:46:53,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:53,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:53,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557870956] [2022-04-15 12:46:53,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557870956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:53,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:53,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:53,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:53,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069745633] [2022-04-15 12:46:53,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069745633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:53,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:53,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:53,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124834160] [2022-04-15 12:46:53,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:53,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:53,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:53,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:46:53,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:53,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:46:53,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:46:53,489 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:53,564 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 12:46:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:46:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 12:46:53,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-04-15 12:46:53,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 29 transitions. [2022-04-15 12:46:53,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,598 INFO L225 Difference]: With dead ends: 25 [2022-04-15 12:46:53,598 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:46:53,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:46:53,600 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:53,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:46:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 12:46:53,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:53,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 12:46:53,611 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 12:46:53,611 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 12:46:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:53,613 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:46:53,613 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:46:53,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:53,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:53,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 12:46:53,614 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 12:46:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:53,615 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 12:46:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 12:46:53,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:53,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:53,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:53,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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 12:46:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 12:46:53,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-15 12:46:53,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:53,617 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 12:46:53,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 12:46:53,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 12:46:53,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:46:53,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:53,637 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:53,637 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:46:53,637 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:53,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:53,638 INFO L85 PathProgramCache]: Analyzing trace with hash -79339060, now seen corresponding path program 1 times [2022-04-15 12:46:53,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:53,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1398023424] [2022-04-15 12:46:53,764 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:53,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1115131409, now seen corresponding path program 1 times [2022-04-15 12:46:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:53,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170033590] [2022-04-15 12:46:53,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:53,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 12:46:53,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 12:46:53,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2022-04-15 12:46:53,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:53,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-15 12:46:53,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-15 12:46:53,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #42#return; {281#true} is VALID [2022-04-15 12:46:53,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-15 12:46:53,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {286#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:53,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {286#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [48] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_1 v_main_~y~0_In_1) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (let ((.cse0 (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296))) (and (not (<= 5000000 .cse0)) (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (< .cse0 (mod v_main_~y~0_In_1 4294967296)) (= v_main_~y~0_In_1 0) (= |v_main_#t~post5_Out_2| 0)))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post5=|v_main_#t~post5_Out_2|, main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {286#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:53,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {286#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [47] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {282#false} is VALID [2022-04-15 12:46:53,899 INFO L272 TraceCheckUtils]: 8: Hoare triple {282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {282#false} is VALID [2022-04-15 12:46:53,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#false} ~cond := #in~cond; {282#false} is VALID [2022-04-15 12:46:53,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#false} assume 0 == ~cond; {282#false} is VALID [2022-04-15 12:46:53,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-15 12:46:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:53,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:53,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170033590] [2022-04-15 12:46:53,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170033590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:53,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:53,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:53,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:53,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1398023424] [2022-04-15 12:46:53,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1398023424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:53,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:53,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:53,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900471288] [2022-04-15 12:46:53,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:46:53,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:53,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:53,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:53,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:46:53,976 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:54,105 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:46:54,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:54,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:46:54,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 12:46:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 12:46:54,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 12:46:54,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,148 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:46:54,148 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 12:46:54,149 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:46:54,150 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:54,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 12:46:54,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-04-15 12:46:54,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:54,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,165 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,165 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:54,167 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:46:54,167 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:46:54,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:54,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:54,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:46:54,168 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 12:46:54,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:54,169 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-15 12:46:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:46:54,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:54,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:54,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:54,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 12:46:54,171 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-15 12:46:54,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:54,171 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 12:46:54,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 12:46:54,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 12:46:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:46:54,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:54,195 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:54,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:46:54,196 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash 2084821988, now seen corresponding path program 2 times [2022-04-15 12:46:54,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383112329] [2022-04-15 12:46:54,281 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1056026065, now seen corresponding path program 1 times [2022-04-15 12:46:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:54,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381282969] [2022-04-15 12:46:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:54,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {429#true} is VALID [2022-04-15 12:46:54,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume true; {429#true} is VALID [2022-04-15 12:46:54,370 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {429#true} {429#true} #42#return; {429#true} is VALID [2022-04-15 12:46:54,370 INFO L272 TraceCheckUtils]: 0: Hoare triple {429#true} call ULTIMATE.init(); {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:54,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {429#true} is VALID [2022-04-15 12:46:54,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {429#true} assume true; {429#true} is VALID [2022-04-15 12:46:54,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {429#true} {429#true} #42#return; {429#true} is VALID [2022-04-15 12:46:54,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {429#true} call #t~ret6 := main(); {429#true} is VALID [2022-04-15 12:46:54,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {429#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {434#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:54,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {434#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [50] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_2 v_main_~y~0_In_2)) (let ((.cse0 (mod (+ v_main_~x~0_Out_4 4294967295) 4294967296))) (and (= |v_main_#t~post5_Out_4| 0) (< .cse0 (mod v_main_~y~0_In_2 4294967296)) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (not (<= 5000000 .cse0)) (= v_main_~y~0_In_2 0)))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_2} OutVars{main_#t~post5=|v_main_#t~post5_Out_4|, main_~y~0=v_main_~y~0_In_2, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {434#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:54,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [49] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {430#false} is VALID [2022-04-15 12:46:54,374 INFO L272 TraceCheckUtils]: 8: Hoare triple {430#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {430#false} is VALID [2022-04-15 12:46:54,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#false} ~cond := #in~cond; {430#false} is VALID [2022-04-15 12:46:54,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {430#false} assume 0 == ~cond; {430#false} is VALID [2022-04-15 12:46:54,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-04-15 12:46:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:54,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:54,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381282969] [2022-04-15 12:46:54,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381282969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:54,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:54,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:54,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:54,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383112329] [2022-04-15 12:46:54,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383112329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:54,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:54,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:46:54,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192780863] [2022-04-15 12:46:54,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:54,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:54,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:54,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:46:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:46:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:46:54,488 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:54,689 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-04-15 12:46:54,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:46:54,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:54,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 12:46:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2022-04-15 12:46:54,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2022-04-15 12:46:54,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,731 INFO L225 Difference]: With dead ends: 31 [2022-04-15 12:46:54,731 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:46:54,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:54,732 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:54,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 29 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:54,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:46:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 12:46:54,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:54,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,748 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,749 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:54,754 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 12:46:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 12:46:54,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:54,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:54,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:46:54,755 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:46:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:54,759 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-15 12:46:54,759 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 12:46:54,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:54,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:54,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:54,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-15 12:46:54,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2022-04-15 12:46:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:54,762 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-15 12:46:54,762 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 23 transitions. [2022-04-15 12:46:54,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-15 12:46:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 12:46:54,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:54,786 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:54,786 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:46:54,786 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:54,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1442444596, now seen corresponding path program 3 times [2022-04-15 12:46:54,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:54,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1511345217] [2022-04-15 12:46:54,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:54,858 INFO L85 PathProgramCache]: Analyzing trace with hash -996920721, now seen corresponding path program 1 times [2022-04-15 12:46:54,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:54,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54422062] [2022-04-15 12:46:54,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:54,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:54,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:54,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {598#true} is VALID [2022-04-15 12:46:54,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} assume true; {598#true} is VALID [2022-04-15 12:46:54,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {598#true} {598#true} #42#return; {598#true} is VALID [2022-04-15 12:46:54,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:54,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {598#true} is VALID [2022-04-15 12:46:54,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2022-04-15 12:46:54,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #42#return; {598#true} is VALID [2022-04-15 12:46:54,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret6 := main(); {598#true} is VALID [2022-04-15 12:46:54,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {603#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:54,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {603#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [52] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_In_3) (= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (let ((.cse0 (mod (+ v_main_~x~0_Out_6 4294967295) 4294967296))) (and (= |v_main_#t~post5_Out_6| 0) (= v_main_~y~0_In_3 0) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_3 4294967296)) (<= v_main_~x~0_In_3 v_main_~x~0_Out_6)))) InVars {main_~x~0=v_main_~x~0_In_3, main_~y~0=v_main_~y~0_In_3} OutVars{main_#t~post5=|v_main_#t~post5_Out_6|, main_~y~0=v_main_~y~0_In_3, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {603#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:54,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {603#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [51] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {599#false} is VALID [2022-04-15 12:46:54,985 INFO L272 TraceCheckUtils]: 8: Hoare triple {599#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {599#false} is VALID [2022-04-15 12:46:54,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {599#false} ~cond := #in~cond; {599#false} is VALID [2022-04-15 12:46:54,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {599#false} assume 0 == ~cond; {599#false} is VALID [2022-04-15 12:46:54,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {599#false} assume !false; {599#false} is VALID [2022-04-15 12:46:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54422062] [2022-04-15 12:46:54,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54422062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:54,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:54,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:55,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:55,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1511345217] [2022-04-15 12:46:55,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1511345217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:55,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:55,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:46:55,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046109754] [2022-04-15 12:46:55,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:55,133 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:46:55,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:55,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:46:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:46:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:46:55,158 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,444 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:46:55,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:46:55,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 12:46:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:55,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:46:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-15 12:46:55,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-15 12:46:55,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,486 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:46:55,486 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:46:55,487 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:55,487 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:55,487 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 34 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:46:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 12:46:55,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:55,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,513 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,514 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,515 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:46:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:46:55,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:55,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:55,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:46:55,516 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 12:46:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,517 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-04-15 12:46:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-04-15 12:46:55,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:55,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:55,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:55,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-15 12:46:55,519 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2022-04-15 12:46:55,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:55,519 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-15 12:46:55,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-15 12:46:55,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 12:46:55,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:46:55,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:55,551 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:55,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:46:55,552 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:55,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1571384604, now seen corresponding path program 4 times [2022-04-15 12:46:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:55,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847673927] [2022-04-15 12:46:55,629 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash -937815377, now seen corresponding path program 1 times [2022-04-15 12:46:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:55,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663742794] [2022-04-15 12:46:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:55,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-15 12:46:55,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-15 12:46:55,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #42#return; {788#true} is VALID [2022-04-15 12:46:55,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:55,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-15 12:46:55,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-15 12:46:55,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #42#return; {788#true} is VALID [2022-04-15 12:46:55,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-15 12:46:55,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {793#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:55,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {793#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [54] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ v_main_~x~0_Out_8 4294967295) 4294967296))) (and (= |v_main_#t~post5_Out_8| 0) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_4 4294967296)) (= v_main_~y~0_In_4 0) (<= v_main_~x~0_In_4 v_main_~x~0_Out_8))) (and (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= v_main_~y~0_In_4 v_main_~y~0_In_4))) InVars {main_~x~0=v_main_~x~0_In_4, main_~y~0=v_main_~y~0_In_4} OutVars{main_#t~post5=|v_main_#t~post5_Out_8|, main_~y~0=v_main_~y~0_In_4, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {794#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:55,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {794#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [53] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {789#false} is VALID [2022-04-15 12:46:55,727 INFO L272 TraceCheckUtils]: 8: Hoare triple {789#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {789#false} is VALID [2022-04-15 12:46:55,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-04-15 12:46:55,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {789#false} assume 0 == ~cond; {789#false} is VALID [2022-04-15 12:46:55,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-15 12:46:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:55,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663742794] [2022-04-15 12:46:55,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663742794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:55,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:55,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:55,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:55,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847673927] [2022-04-15 12:46:55,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847673927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:55,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:55,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:46:55,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233496632] [2022-04-15 12:46:55,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:55,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:46:55,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:55,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:46:55,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:46:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:55,924 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:56,292 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 12:46:56,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:46:56,292 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:46:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:56,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:46:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 12:46:56,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 12:46:56,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:56,339 INFO L225 Difference]: With dead ends: 37 [2022-04-15 12:46:56,339 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:46:56,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:46:56,340 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:56,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 39 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:56,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:46:56,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 12:46:56,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:56,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,366 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,366 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:56,368 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:46:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:46:56,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:56,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:56,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:46:56,369 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:46:56,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:56,372 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 12:46:56,372 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 12:46:56,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:56,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:56,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:56,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:56,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-04-15 12:46:56,375 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2022-04-15 12:46:56,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:56,376 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-04-15 12:46:56,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 29 transitions. [2022-04-15 12:46:56,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-04-15 12:46:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:46:56,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:56,413 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:56,413 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:46:56,413 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:56,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1172566988, now seen corresponding path program 5 times [2022-04-15 12:46:56,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:56,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054363887] [2022-04-15 12:46:56,473 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:56,475 INFO L85 PathProgramCache]: Analyzing trace with hash -878710033, now seen corresponding path program 1 times [2022-04-15 12:46:56,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:56,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370084166] [2022-04-15 12:46:56,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:56,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1000#true} is VALID [2022-04-15 12:46:56,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} assume true; {1000#true} is VALID [2022-04-15 12:46:56,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1000#true} {1000#true} #42#return; {1000#true} is VALID [2022-04-15 12:46:56,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} call ULTIMATE.init(); {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:56,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {1006#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1000#true} is VALID [2022-04-15 12:46:56,596 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} assume true; {1000#true} is VALID [2022-04-15 12:46:56,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} #42#return; {1000#true} is VALID [2022-04-15 12:46:56,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} call #t~ret6 := main(); {1000#true} is VALID [2022-04-15 12:46:56,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1005#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:56,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1005#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [56] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_5 v_main_~y~0_In_5) (= v_main_~x~0_In_5 v_main_~x~0_Out_10)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_10) 4294967296))) (and (= v_main_~y~0_In_5 0) (<= v_main_~x~0_In_5 v_main_~x~0_Out_10) (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_10| 0) (< .cse0 (mod v_main_~y~0_In_5 4294967296))))) InVars {main_~x~0=v_main_~x~0_In_5, main_~y~0=v_main_~y~0_In_5} OutVars{main_#t~post5=|v_main_#t~post5_Out_10|, main_~y~0=v_main_~y~0_In_5, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1005#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:56,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {1005#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [55] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-15 12:46:56,599 INFO L272 TraceCheckUtils]: 8: Hoare triple {1001#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1001#false} is VALID [2022-04-15 12:46:56,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#false} ~cond := #in~cond; {1001#false} is VALID [2022-04-15 12:46:56,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {1001#false} assume 0 == ~cond; {1001#false} is VALID [2022-04-15 12:46:56,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {1001#false} assume !false; {1001#false} is VALID [2022-04-15 12:46:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:56,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370084166] [2022-04-15 12:46:56,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370084166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:56,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:56,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:56,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:56,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054363887] [2022-04-15 12:46:56,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054363887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:56,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:56,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:46:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858606002] [2022-04-15 12:46:56,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:56,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-15 12:46:56,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:56,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:56,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:56,827 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:46:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:56,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:46:56,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:56,828 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:57,254 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:46:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:46:57,255 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 26 [2022-04-15 12:46:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 12:46:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 44 transitions. [2022-04-15 12:46:57,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 44 transitions. [2022-04-15 12:46:57,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:57,302 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:46:57,302 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 12:46:57,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 11 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:46:57,303 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:57,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 44 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:57,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 12:46:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2022-04-15 12:46:57,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:57,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,332 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,332 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:57,333 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:46:57,333 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 12:46:57,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:57,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:57,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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 32 states. [2022-04-15 12:46:57,333 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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 32 states. [2022-04-15 12:46:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:57,334 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:46:57,334 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-04-15 12:46:57,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:57,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:57,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:57,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 12:46:57,336 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2022-04-15 12:46:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:57,336 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 12:46:57,336 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 12:46:57,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 12:46:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:46:57,373 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:57,373 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:57,373 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 12:46:57,373 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 121899492, now seen corresponding path program 6 times [2022-04-15 12:46:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:57,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1010173820] [2022-04-15 12:46:57,439 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash -819604689, now seen corresponding path program 1 times [2022-04-15 12:46:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:57,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905716697] [2022-04-15 12:46:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:57,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:57,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:57,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1232#true} is VALID [2022-04-15 12:46:57,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1232#true} assume true; {1232#true} is VALID [2022-04-15 12:46:57,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1232#true} {1232#true} #42#return; {1232#true} is VALID [2022-04-15 12:46:57,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {1232#true} call ULTIMATE.init(); {1238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:57,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {1238#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1232#true} is VALID [2022-04-15 12:46:57,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {1232#true} assume true; {1232#true} is VALID [2022-04-15 12:46:57,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1232#true} {1232#true} #42#return; {1232#true} is VALID [2022-04-15 12:46:57,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {1232#true} call #t~ret6 := main(); {1232#true} is VALID [2022-04-15 12:46:57,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {1232#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1237#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:57,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {1237#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [58] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_6 v_main_~y~0_In_6) (= v_main_~x~0_In_6 v_main_~x~0_Out_12)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_12) 4294967296))) (and (<= v_main_~x~0_In_6 v_main_~x~0_Out_12) (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_12| 0) (< .cse0 (mod v_main_~y~0_In_6 4294967296)) (= v_main_~y~0_In_6 0)))) InVars {main_~x~0=v_main_~x~0_In_6, main_~y~0=v_main_~y~0_In_6} OutVars{main_#t~post5=|v_main_#t~post5_Out_12|, main_~y~0=v_main_~y~0_In_6, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1237#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:57,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {1237#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [57] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1233#false} is VALID [2022-04-15 12:46:57,531 INFO L272 TraceCheckUtils]: 8: Hoare triple {1233#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1233#false} is VALID [2022-04-15 12:46:57,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {1233#false} ~cond := #in~cond; {1233#false} is VALID [2022-04-15 12:46:57,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {1233#false} assume 0 == ~cond; {1233#false} is VALID [2022-04-15 12:46:57,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {1233#false} assume !false; {1233#false} is VALID [2022-04-15 12:46:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:57,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:57,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905716697] [2022-04-15 12:46:57,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905716697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:57,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:57,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:57,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:57,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1010173820] [2022-04-15 12:46:57,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1010173820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:57,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:57,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:46:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854935745] [2022-04-15 12:46:57,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:57,813 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-15 12:46:57,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:57,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:57,842 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:46:57,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:57,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:46:57,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:46:57,843 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:58,406 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 12:46:58,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:46:58,407 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 29 [2022-04-15 12:46:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:46:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-04-15 12:46:58,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 47 transitions. [2022-04-15 12:46:58,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:58,459 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:46:58,459 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:46:58,459 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 13 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:46:58,460 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:58,460 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:46:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 12:46:58,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:58,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,488 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,488 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:58,489 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-15 12:46:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 12:46:58,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:58,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:58,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 35 states. [2022-04-15 12:46:58,490 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 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 35 states. [2022-04-15 12:46:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:58,491 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-04-15 12:46:58,491 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 12:46:58,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:58,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:58,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:58,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 29 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-04-15 12:46:58,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2022-04-15 12:46:58,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:58,493 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-04-15 12:46:58,493 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 35 transitions. [2022-04-15 12:46:58,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-04-15 12:46:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 12:46:58,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:58,534 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:58,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 12:46:58,534 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1408179404, now seen corresponding path program 7 times [2022-04-15 12:46:58,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:58,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825185831] [2022-04-15 12:46:58,592 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash -760499345, now seen corresponding path program 1 times [2022-04-15 12:46:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:58,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619266778] [2022-04-15 12:46:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:58,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:58,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1485#true} is VALID [2022-04-15 12:46:58,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-15 12:46:58,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1485#true} {1485#true} #42#return; {1485#true} is VALID [2022-04-15 12:46:58,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {1485#true} call ULTIMATE.init(); {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:58,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1485#true} is VALID [2022-04-15 12:46:58,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1485#true} assume true; {1485#true} is VALID [2022-04-15 12:46:58,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1485#true} {1485#true} #42#return; {1485#true} is VALID [2022-04-15 12:46:58,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {1485#true} call #t~ret6 := main(); {1485#true} is VALID [2022-04-15 12:46:58,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {1485#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1490#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:58,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {1490#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [60] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_7 v_main_~y~0_In_7) (= v_main_~x~0_In_7 v_main_~x~0_Out_14)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_14) 4294967296))) (and (< .cse0 (mod v_main_~y~0_In_7 4294967296)) (= |v_main_#t~post5_Out_14| 0) (<= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_7 0) (not (<= 5000000 .cse0))))) InVars {main_~x~0=v_main_~x~0_In_7, main_~y~0=v_main_~y~0_In_7} OutVars{main_#t~post5=|v_main_#t~post5_Out_14|, main_~y~0=v_main_~y~0_In_7, main_~x~0=v_main_~x~0_Out_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1490#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:58,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {1490#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [59] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1486#false} is VALID [2022-04-15 12:46:58,667 INFO L272 TraceCheckUtils]: 8: Hoare triple {1486#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1486#false} is VALID [2022-04-15 12:46:58,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {1486#false} ~cond := #in~cond; {1486#false} is VALID [2022-04-15 12:46:58,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {1486#false} assume 0 == ~cond; {1486#false} is VALID [2022-04-15 12:46:58,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {1486#false} assume !false; {1486#false} is VALID [2022-04-15 12:46:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:58,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:58,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619266778] [2022-04-15 12:46:58,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619266778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:58,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:58,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:59,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:59,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825185831] [2022-04-15 12:46:59,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825185831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:59,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:59,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:46:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793043733] [2022-04-15 12:46:59,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:59,006 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2022-04-15 12:46:59,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:59,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:59,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:46:59,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:59,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:46:59,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:59,037 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:59,669 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:46:59,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:46:59,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 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 32 [2022-04-15 12:46:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 12:46:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2022-04-15 12:46:59,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2022-04-15 12:46:59,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:59,732 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:46:59,732 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 12:46:59,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 9 SyntacticMatches, 15 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:46:59,735 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:59,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 54 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 12:46:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-15 12:46:59,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:59,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,771 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,771 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:59,772 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-15 12:46:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-15 12:46:59,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:59,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:59,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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 38 states. [2022-04-15 12:46:59,773 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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 38 states. [2022-04-15 12:46:59,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:59,774 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-04-15 12:46:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2022-04-15 12:46:59,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:59,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:59,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:59,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:59,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2022-04-15 12:46:59,776 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2022-04-15 12:46:59,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:59,776 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2022-04-15 12:46:59,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:59,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 38 transitions. [2022-04-15 12:46:59,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 12:46:59,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:46:59,821 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:59,822 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:59,822 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 12:46:59,822 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:59,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1274822884, now seen corresponding path program 8 times [2022-04-15 12:46:59,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:59,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479867728] [2022-04-15 12:46:59,884 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash -701394001, now seen corresponding path program 1 times [2022-04-15 12:46:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515623042] [2022-04-15 12:46:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {1766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1759#true} is VALID [2022-04-15 12:46:59,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {1759#true} assume true; {1759#true} is VALID [2022-04-15 12:46:59,956 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1759#true} {1759#true} #42#return; {1759#true} is VALID [2022-04-15 12:46:59,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {1759#true} call ULTIMATE.init(); {1766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:59,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1766#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1759#true} is VALID [2022-04-15 12:46:59,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {1759#true} assume true; {1759#true} is VALID [2022-04-15 12:46:59,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1759#true} {1759#true} #42#return; {1759#true} is VALID [2022-04-15 12:46:59,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {1759#true} call #t~ret6 := main(); {1759#true} is VALID [2022-04-15 12:46:59,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {1759#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {1764#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:59,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {1764#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [62] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_16) 4294967296))) (and (= |v_main_#t~post5_Out_16| 0) (not (<= 5000000 .cse0)) (= v_main_~y~0_In_8 0) (<= v_main_~x~0_In_8 v_main_~x~0_Out_16) (< .cse0 (mod v_main_~y~0_In_8 4294967296)))) (and (= v_main_~y~0_In_8 v_main_~y~0_In_8) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_~x~0=v_main_~x~0_In_8, main_~y~0=v_main_~y~0_In_8} OutVars{main_#t~post5=|v_main_#t~post5_Out_16|, main_~y~0=v_main_~y~0_In_8, main_~x~0=v_main_~x~0_Out_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {1765#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:46:59,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {1765#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [61] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1760#false} is VALID [2022-04-15 12:46:59,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {1760#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {1760#false} is VALID [2022-04-15 12:46:59,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {1760#false} ~cond := #in~cond; {1760#false} is VALID [2022-04-15 12:46:59,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {1760#false} assume 0 == ~cond; {1760#false} is VALID [2022-04-15 12:46:59,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {1760#false} assume !false; {1760#false} is VALID [2022-04-15 12:46:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:59,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:59,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515623042] [2022-04-15 12:46:59,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515623042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:59,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:59,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:00,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:00,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479867728] [2022-04-15 12:47:00,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479867728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:00,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:00,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:47:00,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658128745] [2022-04-15 12:47:00,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:00,347 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 35 [2022-04-15 12:47:00,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:00,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:00,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:00,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:47:00,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:00,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:47:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:47:00,376 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:01,125 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2022-04-15 12:47:01,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:47:01,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 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 35 [2022-04-15 12:47:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:01,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-04-15 12:47:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2022-04-15 12:47:01,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 53 transitions. [2022-04-15 12:47:01,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:01,194 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:47:01,194 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:47:01,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 17 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:47:01,195 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:01,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 59 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:47:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:47:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-04-15 12:47:01,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:01,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,239 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,241 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:01,242 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 12:47:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:47:01,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:01,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:01,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 41 states. [2022-04-15 12:47:01,243 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 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 41 states. [2022-04-15 12:47:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:01,244 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 12:47:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 12:47:01,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:01,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:01,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:01,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 35 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2022-04-15 12:47:01,247 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2022-04-15 12:47:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:01,247 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2022-04-15 12:47:01,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 11 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 41 transitions. [2022-04-15 12:47:01,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2022-04-15 12:47:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:47:01,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:01,297 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:01,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 12:47:01,298 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:01,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1295484364, now seen corresponding path program 9 times [2022-04-15 12:47:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:01,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [979090296] [2022-04-15 12:47:01,349 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash -642288657, now seen corresponding path program 1 times [2022-04-15 12:47:01,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:01,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270162060] [2022-04-15 12:47:01,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:01,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:01,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {2061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2055#true} is VALID [2022-04-15 12:47:01,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-15 12:47:01,414 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2055#true} {2055#true} #42#return; {2055#true} is VALID [2022-04-15 12:47:01,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:01,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {2061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2055#true} is VALID [2022-04-15 12:47:01,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2022-04-15 12:47:01,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #42#return; {2055#true} is VALID [2022-04-15 12:47:01,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret6 := main(); {2055#true} is VALID [2022-04-15 12:47:01,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {2055#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2060#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:01,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {2060#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [64] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) (= v_main_~y~0_In_9 v_main_~y~0_In_9)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_18) 4294967296))) (and (< .cse0 (mod v_main_~y~0_In_9 4294967296)) (= |v_main_#t~post5_Out_18| 0) (= v_main_~y~0_In_9 0) (<= v_main_~x~0_In_9 v_main_~x~0_Out_18) (not (<= 5000000 .cse0))))) InVars {main_~x~0=v_main_~x~0_In_9, main_~y~0=v_main_~y~0_In_9} OutVars{main_#t~post5=|v_main_#t~post5_Out_18|, main_~y~0=v_main_~y~0_In_9, main_~x~0=v_main_~x~0_Out_18} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2060#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:01,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {2060#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [63] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2056#false} is VALID [2022-04-15 12:47:01,417 INFO L272 TraceCheckUtils]: 8: Hoare triple {2056#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2056#false} is VALID [2022-04-15 12:47:01,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {2056#false} ~cond := #in~cond; {2056#false} is VALID [2022-04-15 12:47:01,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {2056#false} assume 0 == ~cond; {2056#false} is VALID [2022-04-15 12:47:01,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2022-04-15 12:47:01,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:01,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270162060] [2022-04-15 12:47:01,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270162060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:01,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:01,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:47:01,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:01,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [979090296] [2022-04-15 12:47:01,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [979090296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:01,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:01,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:47:01,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119357672] [2022-04-15 12:47:01,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:01,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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 38 [2022-04-15 12:47:01,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:01,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:01,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:01,883 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:47:01,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:01,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:47:01,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:47:01,884 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,845 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 12:47:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:47:02,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 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 38 [2022-04-15 12:47:02,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-15 12:47:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-15 12:47:02,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-15 12:47:02,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:02,904 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:47:02,904 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 12:47:02,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 9 SyntacticMatches, 19 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:47:02,905 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:02,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 64 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:47:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 12:47:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-04-15 12:47:02,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:02,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,953 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,953 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,955 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:47:02,955 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 12:47:02,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:02,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:02,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 44 states. [2022-04-15 12:47:02,962 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 44 states. [2022-04-15 12:47:02,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,964 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:47:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2022-04-15 12:47:02,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:02,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:02,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:02,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-15 12:47:02,967 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2022-04-15 12:47:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:02,967 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-15 12:47:02,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-15 12:47:03,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-15 12:47:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:47:03,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:03,022 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:03,022 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 12:47:03,022 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:03,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1653655580, now seen corresponding path program 10 times [2022-04-15 12:47:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:03,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389821725] [2022-04-15 12:47:03,087 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -583183313, now seen corresponding path program 1 times [2022-04-15 12:47:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:03,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316781204] [2022-04-15 12:47:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:03,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:03,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:03,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {2377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2371#true} is VALID [2022-04-15 12:47:03,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-15 12:47:03,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2371#true} {2371#true} #42#return; {2371#true} is VALID [2022-04-15 12:47:03,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {2371#true} call ULTIMATE.init(); {2377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:03,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {2377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2371#true} is VALID [2022-04-15 12:47:03,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#true} assume true; {2371#true} is VALID [2022-04-15 12:47:03,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2371#true} {2371#true} #42#return; {2371#true} is VALID [2022-04-15 12:47:03,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {2371#true} call #t~ret6 := main(); {2371#true} is VALID [2022-04-15 12:47:03,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {2371#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2376#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:03,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {2376#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [66] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_10 v_main_~y~0_In_10)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_20) 4294967296))) (and (= |v_main_#t~post5_Out_20| 0) (< .cse0 (mod v_main_~y~0_In_10 4294967296)) (not (<= 5000000 .cse0)) (<= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= v_main_~y~0_In_10 0)))) InVars {main_~x~0=v_main_~x~0_In_10, main_~y~0=v_main_~y~0_In_10} OutVars{main_#t~post5=|v_main_#t~post5_Out_20|, main_~y~0=v_main_~y~0_In_10, main_~x~0=v_main_~x~0_Out_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2376#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:03,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {2376#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [65] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2372#false} is VALID [2022-04-15 12:47:03,169 INFO L272 TraceCheckUtils]: 8: Hoare triple {2372#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2372#false} is VALID [2022-04-15 12:47:03,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {2372#false} ~cond := #in~cond; {2372#false} is VALID [2022-04-15 12:47:03,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {2372#false} assume 0 == ~cond; {2372#false} is VALID [2022-04-15 12:47:03,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {2372#false} assume !false; {2372#false} is VALID [2022-04-15 12:47:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:03,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:03,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316781204] [2022-04-15 12:47:03,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316781204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:03,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:03,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:47:03,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:03,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389821725] [2022-04-15 12:47:03,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389821725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:03,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:03,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:47:03,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857841959] [2022-04-15 12:47:03,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 41 [2022-04-15 12:47:03,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:03,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:03,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:03,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:47:03,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:03,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:47:03,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:47:03,715 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:04,949 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-04-15 12:47:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:47:04,949 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 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 41 [2022-04-15 12:47:04,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:04,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2022-04-15 12:47:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:04,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2022-04-15 12:47:04,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 59 transitions. [2022-04-15 12:47:05,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:05,016 INFO L225 Difference]: With dead ends: 55 [2022-04-15 12:47:05,016 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:47:05,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 9 SyntacticMatches, 21 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2022-04-15 12:47:05,017 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:05,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 69 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:47:05,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:47:05,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-15 12:47:05,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:05,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:05,053 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:05,053 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:05,054 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-04-15 12:47:05,054 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:47:05,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:05,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:05,054 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 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 47 states. [2022-04-15 12:47:05,054 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 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 47 states. [2022-04-15 12:47:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:05,055 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-04-15 12:47:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 12:47:05,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:05,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:05,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:05,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.048780487804878) internal successors, (43), 41 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:05,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2022-04-15 12:47:05,056 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2022-04-15 12:47:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:05,057 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2022-04-15 12:47:05,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:05,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 47 transitions. [2022-04-15 12:47:05,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:05,112 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2022-04-15 12:47:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 12:47:05,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:05,112 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:05,112 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 12:47:05,112 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:05,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1630720308, now seen corresponding path program 11 times [2022-04-15 12:47:05,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:05,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [873507906] [2022-04-15 12:47:05,162 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -524077969, now seen corresponding path program 1 times [2022-04-15 12:47:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:05,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684322543] [2022-04-15 12:47:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:05,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2708#true} is VALID [2022-04-15 12:47:05,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2708#true} assume true; {2708#true} is VALID [2022-04-15 12:47:05,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2708#true} {2708#true} #42#return; {2708#true} is VALID [2022-04-15 12:47:05,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {2708#true} call ULTIMATE.init(); {2715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:05,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2708#true} is VALID [2022-04-15 12:47:05,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {2708#true} assume true; {2708#true} is VALID [2022-04-15 12:47:05,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2708#true} {2708#true} #42#return; {2708#true} is VALID [2022-04-15 12:47:05,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {2708#true} call #t~ret6 := main(); {2708#true} is VALID [2022-04-15 12:47:05,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {2708#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {2713#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:05,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {2713#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [68] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_22) 4294967296))) (and (= v_main_~y~0_In_11 0) (< .cse0 (mod v_main_~y~0_In_11 4294967296)) (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_22| 0) (<= v_main_~x~0_In_11 v_main_~x~0_Out_22))) (and (= v_main_~y~0_In_11 v_main_~y~0_In_11) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_~x~0=v_main_~x~0_In_11, main_~y~0=v_main_~y~0_In_11} OutVars{main_#t~post5=|v_main_#t~post5_Out_22|, main_~y~0=v_main_~y~0_In_11, main_~x~0=v_main_~x~0_Out_22} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {2714#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:05,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {2714#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [67] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2709#false} is VALID [2022-04-15 12:47:05,250 INFO L272 TraceCheckUtils]: 8: Hoare triple {2709#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {2709#false} is VALID [2022-04-15 12:47:05,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {2709#false} ~cond := #in~cond; {2709#false} is VALID [2022-04-15 12:47:05,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {2709#false} assume 0 == ~cond; {2709#false} is VALID [2022-04-15 12:47:05,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {2709#false} assume !false; {2709#false} is VALID [2022-04-15 12:47:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:05,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:05,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684322543] [2022-04-15 12:47:05,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684322543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:05,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:05,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:05,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:05,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [873507906] [2022-04-15 12:47:05,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [873507906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:05,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:05,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:47:05,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220531056] [2022-04-15 12:47:05,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:05,882 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 44 [2022-04-15 12:47:05,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:05,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:05,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:05,923 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:47:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:47:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:47:05,923 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:07,299 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 12:47:07,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:47:07,299 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 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 44 [2022-04-15 12:47:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 12:47:07,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 62 transitions. [2022-04-15 12:47:07,302 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 62 transitions. [2022-04-15 12:47:07,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:07,388 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:47:07,388 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 12:47:07,389 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 7 SyntacticMatches, 23 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:47:07,390 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:07,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 74 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:47:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 12:47:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2022-04-15 12:47:07,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:07,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,443 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,443 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:07,444 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:47:07,444 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:47:07,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:07,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:07,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 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 50 states. [2022-04-15 12:47:07,445 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 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 50 states. [2022-04-15 12:47:07,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:07,446 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-04-15 12:47:07,446 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2022-04-15 12:47:07,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:07,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:07,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:07,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 44 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2022-04-15 12:47:07,447 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2022-04-15 12:47:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:07,447 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2022-04-15 12:47:07,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:07,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 50 transitions. [2022-04-15 12:47:07,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:07,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 12:47:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:47:07,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:07,524 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:07,524 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 12:47:07,524 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:07,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1265832220, now seen corresponding path program 12 times [2022-04-15 12:47:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:07,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [493139379] [2022-04-15 12:47:07,577 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -464972625, now seen corresponding path program 1 times [2022-04-15 12:47:07,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:07,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822141104] [2022-04-15 12:47:07,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:07,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:07,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {3073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3067#true} is VALID [2022-04-15 12:47:07,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 12:47:07,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3067#true} {3067#true} #42#return; {3067#true} is VALID [2022-04-15 12:47:07,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:07,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {3073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3067#true} is VALID [2022-04-15 12:47:07,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-15 12:47:07,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #42#return; {3067#true} is VALID [2022-04-15 12:47:07,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret6 := main(); {3067#true} is VALID [2022-04-15 12:47:07,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3072#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:07,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {3072#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [70] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_12 v_main_~y~0_In_12) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_24) 4294967296))) (and (= |v_main_#t~post5_Out_24| 0) (= v_main_~y~0_In_12 0) (<= v_main_~x~0_In_12 v_main_~x~0_Out_24) (< .cse0 (mod v_main_~y~0_In_12 4294967296)) (not (<= 5000000 .cse0))))) InVars {main_~x~0=v_main_~x~0_In_12, main_~y~0=v_main_~y~0_In_12} OutVars{main_#t~post5=|v_main_#t~post5_Out_24|, main_~y~0=v_main_~y~0_In_12, main_~x~0=v_main_~x~0_Out_24} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3072#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:07,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {3072#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [69] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3068#false} is VALID [2022-04-15 12:47:07,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {3068#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3068#false} is VALID [2022-04-15 12:47:07,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#false} ~cond := #in~cond; {3068#false} is VALID [2022-04-15 12:47:07,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {3068#false} assume 0 == ~cond; {3068#false} is VALID [2022-04-15 12:47:07,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-15 12:47:07,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:07,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822141104] [2022-04-15 12:47:07,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822141104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:07,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:07,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:47:08,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:08,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [493139379] [2022-04-15 12:47:08,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [493139379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:08,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:08,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:47:08,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321327361] [2022-04-15 12:47:08,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 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 47 [2022-04-15 12:47:08,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:08,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:08,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:08,437 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:47:08,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:08,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:47:08,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2022-04-15 12:47:08,438 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,101 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2022-04-15 12:47:10,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:47:10,102 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 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 47 [2022-04-15 12:47:10,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:10,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 12:47:10,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 65 transitions. [2022-04-15 12:47:10,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 65 transitions. [2022-04-15 12:47:10,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:10,189 INFO L225 Difference]: With dead ends: 61 [2022-04-15 12:47:10,189 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:47:10,190 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 25 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=731, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:47:10,190 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:10,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 79 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:47:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:47:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-04-15 12:47:10,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:10,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,236 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,236 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,237 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 12:47:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:47:10,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:10,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:10,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 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 53 states. [2022-04-15 12:47:10,238 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 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 53 states. [2022-04-15 12:47:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,239 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 12:47:10,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 12:47:10,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:10,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:10,239 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:10,239 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 47 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-04-15 12:47:10,241 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 47 [2022-04-15 12:47:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:10,241 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-04-15 12:47:10,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.6875) internal successors, (43), 15 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 53 transitions. [2022-04-15 12:47:10,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-04-15 12:47:10,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:47:10,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:10,311 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:10,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 12:47:10,311 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1447028788, now seen corresponding path program 13 times [2022-04-15 12:47:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:10,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [784635348] [2022-04-15 12:47:10,364 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -405867281, now seen corresponding path program 1 times [2022-04-15 12:47:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:10,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080977199] [2022-04-15 12:47:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:10,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:10,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {3453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3446#true} is VALID [2022-04-15 12:47:10,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {3446#true} assume true; {3446#true} is VALID [2022-04-15 12:47:10,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3446#true} {3446#true} #42#return; {3446#true} is VALID [2022-04-15 12:47:10,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {3446#true} call ULTIMATE.init(); {3453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:10,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {3453#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3446#true} is VALID [2022-04-15 12:47:10,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {3446#true} assume true; {3446#true} is VALID [2022-04-15 12:47:10,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3446#true} {3446#true} #42#return; {3446#true} is VALID [2022-04-15 12:47:10,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {3446#true} call #t~ret6 := main(); {3446#true} is VALID [2022-04-15 12:47:10,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {3446#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3451#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:10,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {3451#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [72] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_26) 4294967296))) (and (<= v_main_~x~0_In_13 v_main_~x~0_Out_26) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_13 4294967296)) (= |v_main_#t~post5_Out_26| 0) (= v_main_~y~0_In_13 0))) (and (= v_main_~y~0_In_13 v_main_~y~0_In_13) (= v_main_~x~0_In_13 v_main_~x~0_Out_26))) InVars {main_~x~0=v_main_~x~0_In_13, main_~y~0=v_main_~y~0_In_13} OutVars{main_#t~post5=|v_main_#t~post5_Out_26|, main_~y~0=v_main_~y~0_In_13, main_~x~0=v_main_~x~0_Out_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3452#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:10,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {3452#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [71] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3447#false} is VALID [2022-04-15 12:47:10,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {3447#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3447#false} is VALID [2022-04-15 12:47:10,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {3447#false} ~cond := #in~cond; {3447#false} is VALID [2022-04-15 12:47:10,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {3447#false} assume 0 == ~cond; {3447#false} is VALID [2022-04-15 12:47:10,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {3447#false} assume !false; {3447#false} is VALID [2022-04-15 12:47:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:10,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:10,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080977199] [2022-04-15 12:47:10,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080977199] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:10,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:10,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:11,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:11,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [784635348] [2022-04-15 12:47:11,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [784635348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:11,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:11,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:47:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733534378] [2022-04-15 12:47:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:11,441 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 50 [2022-04-15 12:47:11,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:11,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:11,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:11,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:47:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:47:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:47:11,495 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:13,673 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-04-15 12:47:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:47:13,674 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 50 [2022-04-15 12:47:13,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-04-15 12:47:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 68 transitions. [2022-04-15 12:47:13,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 68 transitions. [2022-04-15 12:47:13,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:13,770 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:47:13,770 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 12:47:13,771 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 27 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=901, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:47:13,771 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:13,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 84 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:47:13,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 12:47:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2022-04-15 12:47:13,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:13,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,820 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,820 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:13,821 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-04-15 12:47:13,821 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-15 12:47:13,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:13,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:13,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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 56 states. [2022-04-15 12:47:13,822 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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 56 states. [2022-04-15 12:47:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:13,822 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-04-15 12:47:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-04-15 12:47:13,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:13,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:13,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:13,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 12:47:13,824 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-04-15 12:47:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:13,824 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 12:47:13,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 12:47:13,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 12:47:13,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:47:13,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:13,908 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:13,909 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 12:47:13,909 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash -700095004, now seen corresponding path program 14 times [2022-04-15 12:47:13,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:13,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390433030] [2022-04-15 12:47:13,959 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash -346761937, now seen corresponding path program 1 times [2022-04-15 12:47:13,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:13,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593979829] [2022-04-15 12:47:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:13,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:14,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:14,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {3853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3847#true} is VALID [2022-04-15 12:47:14,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {3847#true} assume true; {3847#true} is VALID [2022-04-15 12:47:14,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3847#true} {3847#true} #42#return; {3847#true} is VALID [2022-04-15 12:47:14,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {3847#true} call ULTIMATE.init(); {3853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:14,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {3853#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3847#true} is VALID [2022-04-15 12:47:14,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {3847#true} assume true; {3847#true} is VALID [2022-04-15 12:47:14,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3847#true} {3847#true} #42#return; {3847#true} is VALID [2022-04-15 12:47:14,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {3847#true} call #t~ret6 := main(); {3847#true} is VALID [2022-04-15 12:47:14,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {3847#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {3852#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:14,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {3852#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [74] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_14 v_main_~y~0_In_14) (= v_main_~x~0_In_14 v_main_~x~0_Out_28)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_28) 4294967296))) (and (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_28| 0) (= v_main_~y~0_In_14 0) (<= v_main_~x~0_In_14 v_main_~x~0_Out_28) (< .cse0 (mod v_main_~y~0_In_14 4294967296))))) InVars {main_~x~0=v_main_~x~0_In_14, main_~y~0=v_main_~y~0_In_14} OutVars{main_#t~post5=|v_main_#t~post5_Out_28|, main_~y~0=v_main_~y~0_In_14, main_~x~0=v_main_~x~0_Out_28} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {3852#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:14,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {3852#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [73] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3848#false} is VALID [2022-04-15 12:47:14,043 INFO L272 TraceCheckUtils]: 8: Hoare triple {3848#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {3848#false} is VALID [2022-04-15 12:47:14,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {3848#false} ~cond := #in~cond; {3848#false} is VALID [2022-04-15 12:47:14,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {3848#false} assume 0 == ~cond; {3848#false} is VALID [2022-04-15 12:47:14,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {3848#false} assume !false; {3848#false} is VALID [2022-04-15 12:47:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:14,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593979829] [2022-04-15 12:47:14,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593979829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:14,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:14,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:47:15,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:15,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390433030] [2022-04-15 12:47:15,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390433030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:15,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:15,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:47:15,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220908866] [2022-04-15 12:47:15,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:15,186 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 53 [2022-04-15 12:47:15,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:15,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:15,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:47:15,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:47:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:47:15,249 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:17,880 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 12:47:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:47:17,881 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 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 53 [2022-04-15 12:47:17,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 12:47:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 71 transitions. [2022-04-15 12:47:17,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 71 transitions. [2022-04-15 12:47:17,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:17,977 INFO L225 Difference]: With dead ends: 67 [2022-04-15 12:47:17,977 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:47:17,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 9 SyntacticMatches, 29 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:47:17,978 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:17,978 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 89 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:47:17,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:47:18,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-15 12:47:18,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:18,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:18,042 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:18,042 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:18,043 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 12:47:18,043 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:47:18,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:18,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:18,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 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 59 states. [2022-04-15 12:47:18,044 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 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 59 states. [2022-04-15 12:47:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:18,045 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-04-15 12:47:18,045 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 12:47:18,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:18,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:18,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:18,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 53 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-04-15 12:47:18,046 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2022-04-15 12:47:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:18,047 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-04-15 12:47:18,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:18,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 59 transitions. [2022-04-15 12:47:18,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-04-15 12:47:18,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 12:47:18,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:18,131 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:18,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 12:47:18,131 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:18,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:18,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1021296436, now seen corresponding path program 15 times [2022-04-15 12:47:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:18,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1440779440] [2022-04-15 12:47:18,181 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash -287656593, now seen corresponding path program 1 times [2022-04-15 12:47:18,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:18,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42461249] [2022-04-15 12:47:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:18,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {4275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4268#true} is VALID [2022-04-15 12:47:18,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-15 12:47:18,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4268#true} {4268#true} #42#return; {4268#true} is VALID [2022-04-15 12:47:18,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {4268#true} call ULTIMATE.init(); {4275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:18,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {4275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4268#true} is VALID [2022-04-15 12:47:18,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {4268#true} assume true; {4268#true} is VALID [2022-04-15 12:47:18,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4268#true} {4268#true} #42#return; {4268#true} is VALID [2022-04-15 12:47:18,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {4268#true} call #t~ret6 := main(); {4268#true} is VALID [2022-04-15 12:47:18,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {4268#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4273#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:18,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {4273#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [76] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_30) 4294967296))) (and (< .cse0 (mod v_main_~y~0_In_15 4294967296)) (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_30| 0) (= v_main_~y~0_In_15 0) (<= v_main_~x~0_In_15 v_main_~x~0_Out_30))) (and (= v_main_~x~0_In_15 v_main_~x~0_Out_30) (= v_main_~y~0_In_15 v_main_~y~0_In_15))) InVars {main_~x~0=v_main_~x~0_In_15, main_~y~0=v_main_~y~0_In_15} OutVars{main_#t~post5=|v_main_#t~post5_Out_30|, main_~y~0=v_main_~y~0_In_15, main_~x~0=v_main_~x~0_Out_30} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4274#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:18,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {4274#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [75] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4269#false} is VALID [2022-04-15 12:47:18,312 INFO L272 TraceCheckUtils]: 8: Hoare triple {4269#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4269#false} is VALID [2022-04-15 12:47:18,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {4269#false} ~cond := #in~cond; {4269#false} is VALID [2022-04-15 12:47:18,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {4269#false} assume 0 == ~cond; {4269#false} is VALID [2022-04-15 12:47:18,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {4269#false} assume !false; {4269#false} is VALID [2022-04-15 12:47:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:18,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42461249] [2022-04-15 12:47:18,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42461249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:18,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:18,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:19,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:19,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1440779440] [2022-04-15 12:47:19,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1440779440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:19,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:19,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:47:19,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727665116] [2022-04-15 12:47:19,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 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 56 [2022-04-15 12:47:19,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:19,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:19,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:19,844 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:47:19,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:19,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:47:19,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:47:19,845 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:23,108 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-15 12:47:23,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:47:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 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 56 [2022-04-15 12:47:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2022-04-15 12:47:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 74 transitions. [2022-04-15 12:47:23,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 74 transitions. [2022-04-15 12:47:23,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:23,217 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:47:23,217 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 12:47:23,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 7 SyntacticMatches, 31 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=103, Invalid=1157, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:47:23,218 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:23,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 94 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:47:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 12:47:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-15 12:47:23,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:23,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,290 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,290 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:23,291 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-15 12:47:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-04-15 12:47:23,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:23,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:23,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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 62 states. [2022-04-15 12:47:23,291 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 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 62 states. [2022-04-15 12:47:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:23,292 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2022-04-15 12:47:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-04-15 12:47:23,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:23,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:23,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:23,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 56 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2022-04-15 12:47:23,294 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 56 [2022-04-15 12:47:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:23,294 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2022-04-15 12:47:23,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:23,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 62 transitions. [2022-04-15 12:47:23,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:23,393 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 12:47:23,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:47:23,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:23,393 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:23,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 12:47:23,393 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:23,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash -746021660, now seen corresponding path program 16 times [2022-04-15 12:47:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:23,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [158876298] [2022-04-15 12:47:23,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:23,466 INFO L85 PathProgramCache]: Analyzing trace with hash -228551249, now seen corresponding path program 1 times [2022-04-15 12:47:23,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:23,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144479394] [2022-04-15 12:47:23,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:23,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:23,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {4717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4711#true} is VALID [2022-04-15 12:47:23,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {4711#true} assume true; {4711#true} is VALID [2022-04-15 12:47:23,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4711#true} {4711#true} #42#return; {4711#true} is VALID [2022-04-15 12:47:23,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {4711#true} call ULTIMATE.init(); {4717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:23,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {4717#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4711#true} is VALID [2022-04-15 12:47:23,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {4711#true} assume true; {4711#true} is VALID [2022-04-15 12:47:23,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4711#true} {4711#true} #42#return; {4711#true} is VALID [2022-04-15 12:47:23,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {4711#true} call #t~ret6 := main(); {4711#true} is VALID [2022-04-15 12:47:23,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {4711#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {4716#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:23,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {4716#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [78] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_16 v_main_~y~0_In_16)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_32) 4294967296))) (and (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_32| 0) (<= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_16 0) (< .cse0 (mod v_main_~y~0_In_16 4294967296))))) InVars {main_~x~0=v_main_~x~0_In_16, main_~y~0=v_main_~y~0_In_16} OutVars{main_#t~post5=|v_main_#t~post5_Out_32|, main_~y~0=v_main_~y~0_In_16, main_~x~0=v_main_~x~0_Out_32} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {4716#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:23,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {4716#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [77] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4712#false} is VALID [2022-04-15 12:47:23,576 INFO L272 TraceCheckUtils]: 8: Hoare triple {4712#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {4712#false} is VALID [2022-04-15 12:47:23,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {4712#false} ~cond := #in~cond; {4712#false} is VALID [2022-04-15 12:47:23,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {4712#false} assume 0 == ~cond; {4712#false} is VALID [2022-04-15 12:47:23,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {4712#false} assume !false; {4712#false} is VALID [2022-04-15 12:47:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:23,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:23,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144479394] [2022-04-15 12:47:23,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144479394] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:23,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:23,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:47:25,329 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:25,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [158876298] [2022-04-15 12:47:25,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [158876298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:25,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:25,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:47:25,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112928273] [2022-04-15 12:47:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:25,330 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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 59 [2022-04-15 12:47:25,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:25,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:25,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:25,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:47:25,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:25,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:47:25,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:47:25,417 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:30,314 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 12:47:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:47:30,315 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 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 59 [2022-04-15 12:47:30,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-15 12:47:30,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 77 transitions. [2022-04-15 12:47:30,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 77 transitions. [2022-04-15 12:47:30,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:30,471 INFO L225 Difference]: With dead ends: 73 [2022-04-15 12:47:30,472 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:47:30,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 33 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=105, Invalid=1227, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:47:30,473 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:30,473 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 99 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:47:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:47:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-04-15 12:47:30,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:30,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,541 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,542 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:30,543 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:47:30,543 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:47:30,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:30,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:30,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 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 65 states. [2022-04-15 12:47:30,543 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 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 65 states. [2022-04-15 12:47:30,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:30,544 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 12:47:30,544 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 12:47:30,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:30,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:30,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:30,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0338983050847457) internal successors, (61), 59 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-04-15 12:47:30,546 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 59 [2022-04-15 12:47:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:30,546 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-04-15 12:47:30,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.75) internal successors, (55), 19 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:30,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 65 transitions. [2022-04-15 12:47:30,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:30,671 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-04-15 12:47:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:47:30,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:30,672 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:30,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 12:47:30,672 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:30,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:30,673 INFO L85 PathProgramCache]: Analyzing trace with hash 872262092, now seen corresponding path program 17 times [2022-04-15 12:47:30,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:30,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1893990913] [2022-04-15 12:47:30,718 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash -169445905, now seen corresponding path program 1 times [2022-04-15 12:47:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:30,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013667896] [2022-04-15 12:47:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:30,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {5180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5174#true} is VALID [2022-04-15 12:47:30,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {5174#true} assume true; {5174#true} is VALID [2022-04-15 12:47:30,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5174#true} {5174#true} #42#return; {5174#true} is VALID [2022-04-15 12:47:30,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {5174#true} call ULTIMATE.init(); {5180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:30,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5174#true} is VALID [2022-04-15 12:47:30,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {5174#true} assume true; {5174#true} is VALID [2022-04-15 12:47:30,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5174#true} {5174#true} #42#return; {5174#true} is VALID [2022-04-15 12:47:30,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {5174#true} call #t~ret6 := main(); {5174#true} is VALID [2022-04-15 12:47:30,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {5174#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5179#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:30,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {5179#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [80] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_17 v_main_~y~0_In_17) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_34) 4294967296))) (and (= v_main_~y~0_In_17 0) (<= v_main_~x~0_In_17 v_main_~x~0_Out_34) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_17 4294967296)) (= |v_main_#t~post5_Out_34| 0)))) InVars {main_~x~0=v_main_~x~0_In_17, main_~y~0=v_main_~y~0_In_17} OutVars{main_#t~post5=|v_main_#t~post5_Out_34|, main_~y~0=v_main_~y~0_In_17, main_~x~0=v_main_~x~0_Out_34} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5179#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:30,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {5179#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [79] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5175#false} is VALID [2022-04-15 12:47:30,817 INFO L272 TraceCheckUtils]: 8: Hoare triple {5175#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {5175#false} is VALID [2022-04-15 12:47:30,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {5175#false} ~cond := #in~cond; {5175#false} is VALID [2022-04-15 12:47:30,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {5175#false} assume 0 == ~cond; {5175#false} is VALID [2022-04-15 12:47:30,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {5175#false} assume !false; {5175#false} is VALID [2022-04-15 12:47:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:30,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:30,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013667896] [2022-04-15 12:47:30,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013667896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:30,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:30,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:47:33,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:33,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1893990913] [2022-04-15 12:47:33,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1893990913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:33,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:33,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:47:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933008070] [2022-04-15 12:47:33,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:33,182 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 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 62 [2022-04-15 12:47:33,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:33,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:33,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:33,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:47:33,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:47:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:47:33,281 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:39,513 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 12:47:39,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:47:39,513 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 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 62 [2022-04-15 12:47:39,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-15 12:47:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 80 transitions. [2022-04-15 12:47:39,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 80 transitions. [2022-04-15 12:47:39,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:39,684 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:47:39,684 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 12:47:39,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 9 SyntacticMatches, 35 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:47:39,685 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:39,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 104 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 12:47:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 12:47:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-04-15 12:47:39,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:39,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,742 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,742 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:39,743 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-15 12:47:39,744 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-04-15 12:47:39,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:39,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:39,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 68 states. [2022-04-15 12:47:39,744 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 68 states. [2022-04-15 12:47:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:39,745 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-15 12:47:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-04-15 12:47:39,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:39,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:39,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:39,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 12:47:39,747 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-04-15 12:47:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:39,748 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 12:47:39,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 20 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:39,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 12:47:39,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 12:47:39,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:47:39,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:39,883 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:39,883 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 12:47:39,883 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:39,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:39,883 INFO L85 PathProgramCache]: Analyzing trace with hash 155620324, now seen corresponding path program 18 times [2022-04-15 12:47:39,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:39,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [749714406] [2022-04-15 12:47:39,924 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash -110340561, now seen corresponding path program 1 times [2022-04-15 12:47:39,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:39,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581440369] [2022-04-15 12:47:39,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:39,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:40,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:40,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {5665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5658#true} is VALID [2022-04-15 12:47:40,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {5658#true} assume true; {5658#true} is VALID [2022-04-15 12:47:40,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5658#true} {5658#true} #42#return; {5658#true} is VALID [2022-04-15 12:47:40,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {5658#true} call ULTIMATE.init(); {5665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:40,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {5665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5658#true} is VALID [2022-04-15 12:47:40,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {5658#true} assume true; {5658#true} is VALID [2022-04-15 12:47:40,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5658#true} {5658#true} #42#return; {5658#true} is VALID [2022-04-15 12:47:40,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {5658#true} call #t~ret6 := main(); {5658#true} is VALID [2022-04-15 12:47:40,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {5658#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {5663#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:40,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {5663#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [82] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_36) 4294967296))) (and (= |v_main_#t~post5_Out_36| 0) (not (<= 5000000 .cse0)) (= v_main_~y~0_In_18 0) (< .cse0 (mod v_main_~y~0_In_18 4294967296)) (<= v_main_~x~0_In_18 v_main_~x~0_Out_36))) (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_18 v_main_~y~0_In_18))) InVars {main_~x~0=v_main_~x~0_In_18, main_~y~0=v_main_~y~0_In_18} OutVars{main_#t~post5=|v_main_#t~post5_Out_36|, main_~y~0=v_main_~y~0_In_18, main_~x~0=v_main_~x~0_Out_36} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {5664#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:40,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {5664#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [81] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5659#false} is VALID [2022-04-15 12:47:40,042 INFO L272 TraceCheckUtils]: 8: Hoare triple {5659#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {5659#false} is VALID [2022-04-15 12:47:40,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {5659#false} ~cond := #in~cond; {5659#false} is VALID [2022-04-15 12:47:40,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {5659#false} assume 0 == ~cond; {5659#false} is VALID [2022-04-15 12:47:40,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {5659#false} assume !false; {5659#false} is VALID [2022-04-15 12:47:40,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:40,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:40,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581440369] [2022-04-15 12:47:40,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581440369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:40,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:40,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:43,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:43,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [749714406] [2022-04-15 12:47:43,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [749714406] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:43,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:43,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:47:43,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233572225] [2022-04-15 12:47:43,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:43,439 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 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 65 [2022-04-15 12:47:43,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:43,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:43,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:43,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:47:43,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:43,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:47:43,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:47:43,553 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:52,508 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-04-15 12:47:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:47:52,509 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 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 65 [2022-04-15 12:47:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2022-04-15 12:47:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 83 transitions. [2022-04-15 12:47:52,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 83 transitions. [2022-04-15 12:47:52,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:52,688 INFO L225 Difference]: With dead ends: 79 [2022-04-15 12:47:52,689 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:47:52,689 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 7 SyntacticMatches, 37 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=121, Invalid=1601, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:47:52,690 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:52,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 109 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 12:47:52,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:47:52,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-04-15 12:47:52,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:52,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,750 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,751 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:52,752 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-04-15 12:47:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:47:52,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:52,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:52,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 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 71 states. [2022-04-15 12:47:52,753 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 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 71 states. [2022-04-15 12:47:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:52,754 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2022-04-15 12:47:52,754 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 12:47:52,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:52,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:52,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:52,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 65 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-04-15 12:47:52,755 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 65 [2022-04-15 12:47:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:52,756 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-04-15 12:47:52,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.772727272727273) internal successors, (61), 21 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:52,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 71 transitions. [2022-04-15 12:47:52,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:52,912 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-04-15 12:47:52,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 12:47:52,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:52,913 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:52,913 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 12:47:52,913 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash 963138252, now seen corresponding path program 19 times [2022-04-15 12:47:52,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:52,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028970481] [2022-04-15 12:47:52,956 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:47:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash -51235217, now seen corresponding path program 1 times [2022-04-15 12:47:52,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:52,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198854821] [2022-04-15 12:47:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:52,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:53,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:53,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {6171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6164#true} is VALID [2022-04-15 12:47:53,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {6164#true} assume true; {6164#true} is VALID [2022-04-15 12:47:53,112 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6164#true} {6164#true} #42#return; {6164#true} is VALID [2022-04-15 12:47:53,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {6164#true} call ULTIMATE.init(); {6171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:53,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {6171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6164#true} is VALID [2022-04-15 12:47:53,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {6164#true} assume true; {6164#true} is VALID [2022-04-15 12:47:53,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6164#true} {6164#true} #42#return; {6164#true} is VALID [2022-04-15 12:47:53,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {6164#true} call #t~ret6 := main(); {6164#true} is VALID [2022-04-15 12:47:53,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {6164#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {6169#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:53,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {6169#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [84] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_38) 4294967296))) (and (= |v_main_#t~post5_Out_38| 0) (= v_main_~y~0_In_19 0) (<= v_main_~x~0_In_19 v_main_~x~0_Out_38) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_19 4294967296)))) (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= v_main_~y~0_In_19 v_main_~y~0_In_19))) InVars {main_~x~0=v_main_~x~0_In_19, main_~y~0=v_main_~y~0_In_19} OutVars{main_#t~post5=|v_main_#t~post5_Out_38|, main_~y~0=v_main_~y~0_In_19, main_~x~0=v_main_~x~0_Out_38} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6170#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:47:53,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {6170#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [83] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6165#false} is VALID [2022-04-15 12:47:53,128 INFO L272 TraceCheckUtils]: 8: Hoare triple {6165#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {6165#false} is VALID [2022-04-15 12:47:53,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {6165#false} ~cond := #in~cond; {6165#false} is VALID [2022-04-15 12:47:53,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {6165#false} assume 0 == ~cond; {6165#false} is VALID [2022-04-15 12:47:53,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {6165#false} assume !false; {6165#false} is VALID [2022-04-15 12:47:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:53,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:53,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198854821] [2022-04-15 12:47:53,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198854821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:53,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:53,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:47:58,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:58,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028970481] [2022-04-15 12:47:58,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028970481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:58,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:58,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:47:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996315493] [2022-04-15 12:47:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:58,943 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 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 68 [2022-04-15 12:47:58,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:58,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:59,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:59,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:47:59,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:59,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:47:59,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:47:59,098 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:10,931 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 12:48:10,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:48:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 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 68 [2022-04-15 12:48:10,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 86 transitions. [2022-04-15 12:48:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:10,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 86 transitions. [2022-04-15 12:48:10,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 86 transitions. [2022-04-15 12:48:11,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:11,117 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:48:11,117 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 12:48:11,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 7 SyntacticMatches, 39 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=127, Invalid=1765, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 12:48:11,119 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:11,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 114 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 12:48:11,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 12:48:11,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-04-15 12:48:11,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:11,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:11,202 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:11,202 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:11,203 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 12:48:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 12:48:11,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:11,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:11,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 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 74 states. [2022-04-15 12:48:11,204 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 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 74 states. [2022-04-15 12:48:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:11,205 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2022-04-15 12:48:11,205 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-04-15 12:48:11,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:11,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:11,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:11,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 68 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-04-15 12:48:11,207 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2022-04-15 12:48:11,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:11,207 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-04-15 12:48:11,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.782608695652174) internal successors, (64), 22 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:11,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 74 transitions. [2022-04-15 12:48:11,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 12:48:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:48:11,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:11,369 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:11,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 12:48:11,369 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:11,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1617906404, now seen corresponding path program 20 times [2022-04-15 12:48:11,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:11,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137962865] [2022-04-15 12:48:11,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 7870127, now seen corresponding path program 1 times [2022-04-15 12:48:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:11,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438146301] [2022-04-15 12:48:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:11,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {6697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6691#true} is VALID [2022-04-15 12:48:11,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {6691#true} assume true; {6691#true} is VALID [2022-04-15 12:48:11,527 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6691#true} {6691#true} #42#return; {6691#true} is VALID [2022-04-15 12:48:11,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {6691#true} call ULTIMATE.init(); {6697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:11,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {6697#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6691#true} is VALID [2022-04-15 12:48:11,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {6691#true} assume true; {6691#true} is VALID [2022-04-15 12:48:11,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6691#true} {6691#true} #42#return; {6691#true} is VALID [2022-04-15 12:48:11,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {6691#true} call #t~ret6 := main(); {6691#true} is VALID [2022-04-15 12:48:11,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {6691#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {6696#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:48:11,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {6696#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [86] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_20 v_main_~y~0_In_20) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_40) 4294967296))) (and (= |v_main_#t~post5_Out_40| 0) (= v_main_~y~0_In_20 0) (not (<= 5000000 .cse0)) (<= v_main_~x~0_In_20 v_main_~x~0_Out_40) (< .cse0 (mod v_main_~y~0_In_20 4294967296))))) InVars {main_~x~0=v_main_~x~0_In_20, main_~y~0=v_main_~y~0_In_20} OutVars{main_#t~post5=|v_main_#t~post5_Out_40|, main_~y~0=v_main_~y~0_In_20, main_~x~0=v_main_~x~0_Out_40} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {6696#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:48:11,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {6696#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [85] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6692#false} is VALID [2022-04-15 12:48:11,538 INFO L272 TraceCheckUtils]: 8: Hoare triple {6692#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {6692#false} is VALID [2022-04-15 12:48:11,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {6692#false} ~cond := #in~cond; {6692#false} is VALID [2022-04-15 12:48:11,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {6692#false} assume 0 == ~cond; {6692#false} is VALID [2022-04-15 12:48:11,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {6692#false} assume !false; {6692#false} is VALID [2022-04-15 12:48:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:11,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:11,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438146301] [2022-04-15 12:48:11,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438146301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:11,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:11,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:48:17,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137962865] [2022-04-15 12:48:17,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137962865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:17,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:17,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:48:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405349481] [2022-04-15 12:48:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:17,689 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 71 [2022-04-15 12:48:17,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:17,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:17,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:17,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:48:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:17,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:48:17,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:48:17,849 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:32,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:32,847 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2022-04-15 12:48:32,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:48:32,847 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 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 71 [2022-04-15 12:48:32,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:32,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 89 transitions. [2022-04-15 12:48:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:32,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 89 transitions. [2022-04-15 12:48:32,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 89 transitions. [2022-04-15 12:48:33,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:33,108 INFO L225 Difference]: With dead ends: 85 [2022-04-15 12:48:33,108 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:48:33,113 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 9 SyntacticMatches, 41 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=129, Invalid=1851, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:48:33,114 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 53 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1471 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:33,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 119 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1471 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 12:48:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:48:33,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-04-15 12:48:33,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:33,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,176 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,176 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,177 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 12:48:33,177 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:48:33,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:33,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:33,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 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 77 states. [2022-04-15 12:48:33,178 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 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 77 states. [2022-04-15 12:48:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:33,179 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 12:48:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 12:48:33,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:33,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:33,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:33,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:33,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-04-15 12:48:33,180 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 71 [2022-04-15 12:48:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:33,181 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-04-15 12:48:33,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:33,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 77 transitions. [2022-04-15 12:48:33,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-04-15 12:48:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:48:33,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:33,364 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:33,364 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 12:48:33,364 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:33,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:33,365 INFO L85 PathProgramCache]: Analyzing trace with hash 74464204, now seen corresponding path program 21 times [2022-04-15 12:48:33,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:33,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157835120] [2022-04-15 12:48:33,407 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:48:33,409 INFO L85 PathProgramCache]: Analyzing trace with hash 66975471, now seen corresponding path program 1 times [2022-04-15 12:48:33,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:33,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419056729] [2022-04-15 12:48:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:33,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:33,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:33,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {7245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7238#true} is VALID [2022-04-15 12:48:33,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {7238#true} assume true; {7238#true} is VALID [2022-04-15 12:48:33,546 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7238#true} {7238#true} #42#return; {7238#true} is VALID [2022-04-15 12:48:33,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {7238#true} call ULTIMATE.init(); {7245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:33,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {7245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7238#true} is VALID [2022-04-15 12:48:33,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {7238#true} assume true; {7238#true} is VALID [2022-04-15 12:48:33,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7238#true} {7238#true} #42#return; {7238#true} is VALID [2022-04-15 12:48:33,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {7238#true} call #t~ret6 := main(); {7238#true} is VALID [2022-04-15 12:48:33,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {7238#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {7243#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:48:33,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {7243#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [88] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_42) 4294967296))) (and (= v_main_~y~0_In_21 0) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_21 4294967296)) (= |v_main_#t~post5_Out_42| 0) (<= v_main_~x~0_In_21 v_main_~x~0_Out_42))) (and (= v_main_~y~0_In_21 v_main_~y~0_In_21) (= v_main_~x~0_In_21 v_main_~x~0_Out_42))) InVars {main_~x~0=v_main_~x~0_In_21, main_~y~0=v_main_~y~0_In_21} OutVars{main_#t~post5=|v_main_#t~post5_Out_42|, main_~y~0=v_main_~y~0_In_21, main_~x~0=v_main_~x~0_Out_42} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7244#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:48:33,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {7244#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [87] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {7239#false} is VALID [2022-04-15 12:48:33,559 INFO L272 TraceCheckUtils]: 8: Hoare triple {7239#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {7239#false} is VALID [2022-04-15 12:48:33,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {7239#false} ~cond := #in~cond; {7239#false} is VALID [2022-04-15 12:48:33,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {7239#false} assume 0 == ~cond; {7239#false} is VALID [2022-04-15 12:48:33,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {7239#false} assume !false; {7239#false} is VALID [2022-04-15 12:48:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:33,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:33,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419056729] [2022-04-15 12:48:33,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419056729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:33,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:33,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:48:42,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157835120] [2022-04-15 12:48:42,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157835120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:42,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:42,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:48:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237909413] [2022-04-15 12:48:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:42,772 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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 74 [2022-04-15 12:48:42,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:42,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:42,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:42,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:48:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:42,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:48:42,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:48:42,961 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:07,773 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 12:49:07,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:49:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 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 74 [2022-04-15 12:49:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 92 transitions. [2022-04-15 12:49:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:07,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 92 transitions. [2022-04-15 12:49:07,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 92 transitions. [2022-04-15 12:49:08,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:08,053 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:49:08,053 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 12:49:08,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 7 SyntacticMatches, 43 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=139, Invalid=2117, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:49:08,054 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1607 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:08,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 124 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1607 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 12:49:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 12:49:08,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-04-15 12:49:08,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:08,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:08,130 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:08,130 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:08,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:08,131 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:49:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:49:08,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:08,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:08,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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 80 states. [2022-04-15 12:49:08,131 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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 80 states. [2022-04-15 12:49:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:08,132 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:49:08,132 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-04-15 12:49:08,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:08,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:08,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:08,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 12:49:08,133 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-15 12:49:08,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:08,134 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 12:49:08,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.8) internal successors, (70), 24 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:08,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 12:49:08,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:08,349 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 12:49:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:49:08,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:08,350 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:08,350 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 12:49:08,350 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:08,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:08,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1307754980, now seen corresponding path program 22 times [2022-04-15 12:49:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:08,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468286258] [2022-04-15 12:49:08,397 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:49:08,399 INFO L85 PathProgramCache]: Analyzing trace with hash 126080815, now seen corresponding path program 1 times [2022-04-15 12:49:08,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:08,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056824140] [2022-04-15 12:49:08,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:08,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:08,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {7813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7807#true} is VALID [2022-04-15 12:49:08,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {7807#true} assume true; {7807#true} is VALID [2022-04-15 12:49:08,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7807#true} {7807#true} #42#return; {7807#true} is VALID [2022-04-15 12:49:08,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {7807#true} call ULTIMATE.init(); {7813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:08,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {7813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7807#true} is VALID [2022-04-15 12:49:08,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {7807#true} assume true; {7807#true} is VALID [2022-04-15 12:49:08,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7807#true} {7807#true} #42#return; {7807#true} is VALID [2022-04-15 12:49:08,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {7807#true} call #t~ret6 := main(); {7807#true} is VALID [2022-04-15 12:49:08,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {7807#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {7812#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:49:08,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {7812#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [90] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_22 v_main_~y~0_In_22) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_44) 4294967296))) (and (not (<= 5000000 .cse0)) (= v_main_~y~0_In_22 0) (< .cse0 (mod v_main_~y~0_In_22 4294967296)) (= |v_main_#t~post5_Out_44| 0) (<= v_main_~x~0_In_22 v_main_~x~0_Out_44)))) InVars {main_~x~0=v_main_~x~0_In_22, main_~y~0=v_main_~y~0_In_22} OutVars{main_#t~post5=|v_main_#t~post5_Out_44|, main_~y~0=v_main_~y~0_In_22, main_~x~0=v_main_~x~0_Out_44} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {7812#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:49:08,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {7812#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [89] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {7808#false} is VALID [2022-04-15 12:49:08,543 INFO L272 TraceCheckUtils]: 8: Hoare triple {7808#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {7808#false} is VALID [2022-04-15 12:49:08,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {7808#false} ~cond := #in~cond; {7808#false} is VALID [2022-04-15 12:49:08,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {7808#false} assume 0 == ~cond; {7808#false} is VALID [2022-04-15 12:49:08,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {7808#false} assume !false; {7808#false} is VALID [2022-04-15 12:49:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:08,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:08,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056824140] [2022-04-15 12:49:08,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056824140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:08,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:08,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:49:29,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:29,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [468286258] [2022-04-15 12:49:29,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [468286258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:29,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:29,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:49:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67942114] [2022-04-15 12:49:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:29,640 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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 77 [2022-04-15 12:49:29,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:29,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:29,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:29,881 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:49:29,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:29,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:49:29,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:49:29,882 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:01,490 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-15 12:50:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:50:01,490 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 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 77 [2022-04-15 12:50:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 12:50:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 95 transitions. [2022-04-15 12:50:01,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 95 transitions. [2022-04-15 12:50:01,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:01,810 INFO L225 Difference]: With dead ends: 91 [2022-04-15 12:50:01,810 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:50:01,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 9 SyntacticMatches, 45 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=141, Invalid=2211, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:50:01,812 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:01,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 129 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 12:50:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:50:01,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2022-04-15 12:50:01,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:01,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,880 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,880 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:01,881 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-04-15 12:50:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 12:50:01,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:01,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:01,882 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 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 83 states. [2022-04-15 12:50:01,882 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 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 83 states. [2022-04-15 12:50:01,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:01,883 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2022-04-15 12:50:01,883 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 12:50:01,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:01,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:01,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:01,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2022-04-15 12:50:01,885 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 77 [2022-04-15 12:50:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:01,885 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2022-04-15 12:50:01,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.8076923076923075) internal successors, (73), 25 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:01,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 83 transitions. [2022-04-15 12:50:02,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2022-04-15 12:50:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-15 12:50:02,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:02,149 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:02,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 12:50:02,150 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1171954484, now seen corresponding path program 23 times [2022-04-15 12:50:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [108072913] [2022-04-15 12:50:02,205 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash 185186159, now seen corresponding path program 1 times [2022-04-15 12:50:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:02,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271998893] [2022-04-15 12:50:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:02,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:02,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {8402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8396#true} is VALID [2022-04-15 12:50:02,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {8396#true} assume true; {8396#true} is VALID [2022-04-15 12:50:02,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8396#true} {8396#true} #42#return; {8396#true} is VALID [2022-04-15 12:50:02,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {8396#true} call ULTIMATE.init(); {8402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:02,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {8402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8396#true} is VALID [2022-04-15 12:50:02,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {8396#true} assume true; {8396#true} is VALID [2022-04-15 12:50:02,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8396#true} {8396#true} #42#return; {8396#true} is VALID [2022-04-15 12:50:02,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {8396#true} call #t~ret6 := main(); {8396#true} is VALID [2022-04-15 12:50:02,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {8396#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {8401#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:50:02,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {8401#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [92] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_23 v_main_~y~0_In_23) (= v_main_~x~0_In_23 v_main_~x~0_Out_46)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_46) 4294967296))) (and (= |v_main_#t~post5_Out_46| 0) (<= v_main_~x~0_In_23 v_main_~x~0_Out_46) (not (<= 5000000 .cse0)) (= v_main_~y~0_In_23 0) (< .cse0 (mod v_main_~y~0_In_23 4294967296))))) InVars {main_~x~0=v_main_~x~0_In_23, main_~y~0=v_main_~y~0_In_23} OutVars{main_#t~post5=|v_main_#t~post5_Out_46|, main_~y~0=v_main_~y~0_In_23, main_~x~0=v_main_~x~0_Out_46} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {8401#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:50:02,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {8401#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [91] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {8397#false} is VALID [2022-04-15 12:50:02,397 INFO L272 TraceCheckUtils]: 8: Hoare triple {8397#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {8397#false} is VALID [2022-04-15 12:50:02,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {8397#false} ~cond := #in~cond; {8397#false} is VALID [2022-04-15 12:50:02,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {8397#false} assume 0 == ~cond; {8397#false} is VALID [2022-04-15 12:50:02,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {8397#false} assume !false; {8397#false} is VALID [2022-04-15 12:50:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:02,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:02,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271998893] [2022-04-15 12:50:02,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271998893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:02,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:02,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:50:19,370 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [108072913] [2022-04-15 12:50:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [108072913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:19,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:19,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:50:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329208204] [2022-04-15 12:50:19,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 80 [2022-04-15 12:50:19,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:19,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:19,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:19,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:50:19,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:19,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:50:19,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:50:19,620 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:51,793 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 12:50:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:50:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 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 80 [2022-04-15 12:50:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 98 transitions. [2022-04-15 12:50:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 98 transitions. [2022-04-15 12:50:51,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 98 transitions. [2022-04-15 12:50:52,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:52,146 INFO L225 Difference]: With dead ends: 94 [2022-04-15 12:50:52,146 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 12:50:52,147 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 9 SyntacticMatches, 47 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:50:52,147 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 59 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1897 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:52,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 134 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1897 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 12:50:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 12:50:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2022-04-15 12:50:52,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:52,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:52,225 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:52,225 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:52,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:52,225 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-04-15 12:50:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-15 12:50:52,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:52,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:52,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 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 86 states. [2022-04-15 12:50:52,226 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 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 86 states. [2022-04-15 12:50:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:52,227 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-04-15 12:50:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-04-15 12:50:52,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:52,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:52,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:52,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:52,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.025) internal successors, (82), 80 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2022-04-15 12:50:52,228 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 80 [2022-04-15 12:50:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:52,229 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2022-04-15 12:50:52,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.814814814814815) internal successors, (76), 26 states have internal predecessors, (76), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:52,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 86 transitions. [2022-04-15 12:50:52,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 12:50:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 12:50:52,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:52,565 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:52,565 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 12:50:52,565 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:52,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:52,565 INFO L85 PathProgramCache]: Analyzing trace with hash -759105308, now seen corresponding path program 24 times [2022-04-15 12:50:52,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:52,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [453922958] [2022-04-15 12:50:52,607 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:50:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash 244291503, now seen corresponding path program 1 times [2022-04-15 12:50:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:52,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572773467] [2022-04-15 12:50:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:52,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:52,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {9013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9006#true} is VALID [2022-04-15 12:50:52,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {9006#true} assume true; {9006#true} is VALID [2022-04-15 12:50:52,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9006#true} {9006#true} #42#return; {9006#true} is VALID [2022-04-15 12:50:52,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {9006#true} call ULTIMATE.init(); {9013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:52,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {9013#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9006#true} is VALID [2022-04-15 12:50:52,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {9006#true} assume true; {9006#true} is VALID [2022-04-15 12:50:52,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9006#true} {9006#true} #42#return; {9006#true} is VALID [2022-04-15 12:50:52,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {9006#true} call #t~ret6 := main(); {9006#true} is VALID [2022-04-15 12:50:52,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {9006#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {9011#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:50:52,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {9011#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [94] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_48) 4294967296))) (and (= v_main_~y~0_In_24 0) (< .cse0 (mod v_main_~y~0_In_24 4294967296)) (<= v_main_~x~0_In_24 v_main_~x~0_Out_48) (not (<= 5000000 .cse0)) (= |v_main_#t~post5_Out_48| 0))) (and (= v_main_~x~0_In_24 v_main_~x~0_Out_48) (= v_main_~y~0_In_24 v_main_~y~0_In_24))) InVars {main_~x~0=v_main_~x~0_In_24, main_~y~0=v_main_~y~0_In_24} OutVars{main_#t~post5=|v_main_#t~post5_Out_48|, main_~y~0=v_main_~y~0_In_24, main_~x~0=v_main_~x~0_Out_48} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {9012#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:50:52,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {9012#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [93] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {9007#false} is VALID [2022-04-15 12:50:52,830 INFO L272 TraceCheckUtils]: 8: Hoare triple {9007#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {9007#false} is VALID [2022-04-15 12:50:52,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {9007#false} ~cond := #in~cond; {9007#false} is VALID [2022-04-15 12:50:52,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {9007#false} assume 0 == ~cond; {9007#false} is VALID [2022-04-15 12:50:52,830 INFO L290 TraceCheckUtils]: 11: Hoare triple {9007#false} assume !false; {9007#false} is VALID [2022-04-15 12:50:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:52,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572773467] [2022-04-15 12:50:52,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572773467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:52,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:52,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:51:21,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:21,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [453922958] [2022-04-15 12:51:21,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [453922958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:21,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:21,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:51:21,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476552505] [2022-04-15 12:51:21,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:21,184 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 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 83 [2022-04-15 12:51:21,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:21,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:21,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:21,480 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:51:21,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:51:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:51:21,481 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:01,915 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-15 12:52:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:52:01,915 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 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 83 [2022-04-15 12:52:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:01,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:01,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 101 transitions. [2022-04-15 12:52:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:01,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 101 transitions. [2022-04-15 12:52:01,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 101 transitions. [2022-04-15 12:52:02,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:02,278 INFO L225 Difference]: With dead ends: 97 [2022-04-15 12:52:02,278 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 12:52:02,279 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 7 SyntacticMatches, 49 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=157, Invalid=2705, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 12:52:02,280 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:02,280 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 139 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 12:52:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 12:52:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2022-04-15 12:52:02,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:02,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:02,354 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:02,354 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:02,355 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:52:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:52:02,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:02,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:02,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 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 89 states. [2022-04-15 12:52:02,356 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 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 89 states. [2022-04-15 12:52:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:02,356 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 12:52:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 12:52:02,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:02,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:02,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:02,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:02,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0240963855421688) internal successors, (85), 83 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-04-15 12:52:02,358 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83 [2022-04-15 12:52:02,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:02,358 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-04-15 12:52:02,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.8214285714285716) internal successors, (79), 27 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:02,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 89 transitions. [2022-04-15 12:52:02,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-04-15 12:52:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 12:52:02,610 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:02,610 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:02,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 12:52:02,611 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1939328460, now seen corresponding path program 25 times [2022-04-15 12:52:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:02,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789103041] [2022-04-15 12:52:02,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:52:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 303396847, now seen corresponding path program 1 times [2022-04-15 12:52:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466435531] [2022-04-15 12:52:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:02,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:02,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {9644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9638#true} is VALID [2022-04-15 12:52:02,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {9638#true} assume true; {9638#true} is VALID [2022-04-15 12:52:02,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9638#true} {9638#true} #42#return; {9638#true} is VALID [2022-04-15 12:52:02,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {9638#true} call ULTIMATE.init(); {9644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:02,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {9644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9638#true} is VALID [2022-04-15 12:52:02,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {9638#true} assume true; {9638#true} is VALID [2022-04-15 12:52:02,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9638#true} {9638#true} #42#return; {9638#true} is VALID [2022-04-15 12:52:02,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {9638#true} call #t~ret6 := main(); {9638#true} is VALID [2022-04-15 12:52:02,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {9638#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {9643#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:52:02,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {9643#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [96] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~y~0_In_25 v_main_~y~0_In_25) (= v_main_~x~0_In_25 v_main_~x~0_Out_50)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_50) 4294967296))) (and (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_25 4294967296)) (= |v_main_#t~post5_Out_50| 0) (= v_main_~y~0_In_25 0) (<= v_main_~x~0_In_25 v_main_~x~0_Out_50)))) InVars {main_~x~0=v_main_~x~0_In_25, main_~y~0=v_main_~y~0_In_25} OutVars{main_#t~post5=|v_main_#t~post5_Out_50|, main_~y~0=v_main_~y~0_In_25, main_~x~0=v_main_~x~0_Out_50} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {9643#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:52:02,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {9643#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [95] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {9639#false} is VALID [2022-04-15 12:52:02,831 INFO L272 TraceCheckUtils]: 8: Hoare triple {9639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {9639#false} is VALID [2022-04-15 12:52:02,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {9639#false} ~cond := #in~cond; {9639#false} is VALID [2022-04-15 12:52:02,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {9639#false} assume 0 == ~cond; {9639#false} is VALID [2022-04-15 12:52:02,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {9639#false} assume !false; {9639#false} is VALID [2022-04-15 12:52:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:02,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:02,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466435531] [2022-04-15 12:52:02,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466435531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:02,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:02,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:52:42,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:42,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789103041] [2022-04-15 12:52:42,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789103041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:42,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:42,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:52:42,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936772119] [2022-04-15 12:52:42,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:42,724 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 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 86 [2022-04-15 12:52:42,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:42,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:43,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:43,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:52:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:52:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2022-04-15 12:52:43,083 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,521 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2022-04-15 12:53:37,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:53:37,521 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 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 86 [2022-04-15 12:53:37,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 104 transitions. [2022-04-15 12:53:37,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 104 transitions. [2022-04-15 12:53:37,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 104 transitions. [2022-04-15 12:53:37,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:37,911 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:53:37,911 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 12:53:37,912 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 9 SyntacticMatches, 51 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 51.5s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:53:37,912 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:37,913 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 144 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-15 12:53:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 12:53:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-15 12:53:37,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:37,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,992 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,992 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,993 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 12:53:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-04-15 12:53:37,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:37,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:37,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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 92 states. [2022-04-15 12:53:37,993 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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 92 states. [2022-04-15 12:53:37,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,994 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 12:53:37,994 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-04-15 12:53:37,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:37,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:37,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:37,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 12:53:37,995 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2022-04-15 12:53:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:37,995 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 12:53:37,995 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 12:53:38,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 12:53:38,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 12:53:38,367 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:38,367 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:38,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 12:53:38,368 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2076831716, now seen corresponding path program 26 times [2022-04-15 12:53:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:38,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [418284159] [2022-04-15 12:53:38,411 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:53:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash 362502191, now seen corresponding path program 1 times [2022-04-15 12:53:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:38,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605087639] [2022-04-15 12:53:38,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:38,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:38,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:38,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {10297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10290#true} is VALID [2022-04-15 12:53:38,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {10290#true} assume true; {10290#true} is VALID [2022-04-15 12:53:38,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10290#true} {10290#true} #42#return; {10290#true} is VALID [2022-04-15 12:53:38,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {10290#true} call ULTIMATE.init(); {10297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:38,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {10297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10290#true} is VALID [2022-04-15 12:53:38,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {10290#true} assume true; {10290#true} is VALID [2022-04-15 12:53:38,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10290#true} {10290#true} #42#return; {10290#true} is VALID [2022-04-15 12:53:38,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {10290#true} call #t~ret6 := main(); {10290#true} is VALID [2022-04-15 12:53:38,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {10290#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {10295#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:53:38,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {10295#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [98] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_52) 4294967296))) (and (<= v_main_~x~0_In_26 v_main_~x~0_Out_52) (= v_main_~y~0_In_26 0) (not (<= 5000000 .cse0)) (< .cse0 (mod v_main_~y~0_In_26 4294967296)) (= |v_main_#t~post5_Out_52| 0))) (and (= v_main_~y~0_In_26 v_main_~y~0_In_26) (= v_main_~x~0_In_26 v_main_~x~0_Out_52))) InVars {main_~x~0=v_main_~x~0_In_26, main_~y~0=v_main_~y~0_In_26} OutVars{main_#t~post5=|v_main_#t~post5_Out_52|, main_~y~0=v_main_~y~0_In_26, main_~x~0=v_main_~x~0_Out_52} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {10296#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:53:38,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {10296#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [97] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {10291#false} is VALID [2022-04-15 12:53:38,772 INFO L272 TraceCheckUtils]: 8: Hoare triple {10291#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {10291#false} is VALID [2022-04-15 12:53:38,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {10291#false} ~cond := #in~cond; {10291#false} is VALID [2022-04-15 12:53:38,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {10291#false} assume 0 == ~cond; {10291#false} is VALID [2022-04-15 12:53:38,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {10291#false} assume !false; {10291#false} is VALID [2022-04-15 12:53:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:38,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605087639] [2022-04-15 12:53:38,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605087639] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:38,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:38,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:54:32,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:54:32,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [418284159] [2022-04-15 12:54:32,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [418284159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:54:32,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:54:32,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:54:32,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367893857] [2022-04-15 12:54:32,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:54:32,431 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 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 89 [2022-04-15 12:54:32,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:54:32,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:32,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:32,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:54:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:54:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:54:32,763 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:49,808 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 12:55:49,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:55:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 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 89 [2022-04-15 12:55:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:49,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:49,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 107 transitions. [2022-04-15 12:55:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 107 transitions. [2022-04-15 12:55:49,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 107 transitions. [2022-04-15 12:55:50,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:50,311 INFO L225 Difference]: With dead ends: 103 [2022-04-15 12:55:50,311 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 12:55:50,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 7 SyntacticMatches, 53 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 71.9s TimeCoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:55:50,312 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 2407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:50,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 149 Invalid, 2407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-04-15 12:55:50,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 12:55:50,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-04-15 12:55:50,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:50,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,391 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,391 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:50,393 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-04-15 12:55:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 12:55:50,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:50,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:50,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 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 95 states. [2022-04-15 12:55:50,393 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 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 95 states. [2022-04-15 12:55:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:50,394 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-04-15 12:55:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 12:55:50,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:50,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:50,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:50,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0224719101123596) internal successors, (91), 89 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2022-04-15 12:55:50,396 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 89 [2022-04-15 12:55:50,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:50,397 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2022-04-15 12:55:50,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 29 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:50,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 95 transitions. [2022-04-15 12:55:50,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:50,879 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2022-04-15 12:55:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 12:55:50,879 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:50,879 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:50,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 12:55:50,879 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:50,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:50,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1037530828, now seen corresponding path program 27 times [2022-04-15 12:55:50,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:50,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442456088] [2022-04-15 12:55:50,919 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:55:50,921 INFO L85 PathProgramCache]: Analyzing trace with hash 421607535, now seen corresponding path program 1 times [2022-04-15 12:55:50,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:50,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895506729] [2022-04-15 12:55:50,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:50,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:51,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:51,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {10971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10964#true} is VALID [2022-04-15 12:55:51,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {10964#true} assume true; {10964#true} is VALID [2022-04-15 12:55:51,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10964#true} {10964#true} #42#return; {10964#true} is VALID [2022-04-15 12:55:51,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {10964#true} call ULTIMATE.init(); {10971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:51,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {10971#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10964#true} is VALID [2022-04-15 12:55:51,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {10964#true} assume true; {10964#true} is VALID [2022-04-15 12:55:51,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10964#true} {10964#true} #42#return; {10964#true} is VALID [2022-04-15 12:55:51,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {10964#true} call #t~ret6 := main(); {10964#true} is VALID [2022-04-15 12:55:51,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {10964#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {10969#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:55:51,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {10969#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [100] L10-2-->L10-3_primed: Formula: (or (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_54) 4294967296))) (and (= |v_main_#t~post5_Out_54| 0) (< .cse0 (mod v_main_~y~0_In_27 4294967296)) (<= v_main_~x~0_In_27 v_main_~x~0_Out_54) (not (<= 5000000 .cse0)) (= v_main_~y~0_In_27 0))) (and (= v_main_~y~0_In_27 v_main_~y~0_In_27) (= v_main_~x~0_In_27 v_main_~x~0_Out_54))) InVars {main_~x~0=v_main_~x~0_In_27, main_~y~0=v_main_~y~0_In_27} OutVars{main_#t~post5=|v_main_#t~post5_Out_54|, main_~y~0=v_main_~y~0_In_27, main_~x~0=v_main_~x~0_Out_54} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {10970#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:55:51,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {10970#(and (<= (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (<= (+ main_~x~0 10000000) main_~y~0) (<= (div main_~y~0 4294967296) 0))} [99] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {10965#false} is VALID [2022-04-15 12:55:51,265 INFO L272 TraceCheckUtils]: 8: Hoare triple {10965#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {10965#false} is VALID [2022-04-15 12:55:51,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {10965#false} ~cond := #in~cond; {10965#false} is VALID [2022-04-15 12:55:51,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {10965#false} assume 0 == ~cond; {10965#false} is VALID [2022-04-15 12:55:51,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {10965#false} assume !false; {10965#false} is VALID [2022-04-15 12:55:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:51,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:51,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895506729] [2022-04-15 12:55:51,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895506729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:55:51,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:55:51,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:57:03,004 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:03,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442456088] [2022-04-15 12:57:03,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442456088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:03,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:03,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:57:03,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532924441] [2022-04-15 12:57:03,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:03,005 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 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 92 [2022-04-15 12:57:03,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:03,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:03,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:03,478 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:57:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:03,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:57:03,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2022-04-15 12:57:03,479 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:52,473 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-15 12:58:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:58:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 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 92 [2022-04-15 12:58:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:58:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2022-04-15 12:58:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:52,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 110 transitions. [2022-04-15 12:58:52,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 110 transitions. [2022-04-15 12:58:53,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:53,116 INFO L225 Difference]: With dead ends: 106 [2022-04-15 12:58:53,116 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 12:58:53,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 7 SyntacticMatches, 55 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 98.2s TimeCoverageRelationStatistics Valid=175, Invalid=3365, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:58:53,117 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2549 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:58:53,117 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 154 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2549 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2022-04-15 12:58:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 12:58:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-15 12:58:53,202 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:58:53,202 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:53,203 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:53,203 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:53,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:53,204 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-15 12:58:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-04-15 12:58:53,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:53,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:53,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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 98 states. [2022-04-15 12:58:53,204 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 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 98 states. [2022-04-15 12:58:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:58:53,205 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-04-15 12:58:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-04-15 12:58:53,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:58:53,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:58:53,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:58:53,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:58:53,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0217391304347827) internal successors, (94), 92 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:53,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2022-04-15 12:58:53,207 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2022-04-15 12:58:53,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:58:53,207 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2022-04-15 12:58:53,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.838709677419355) internal successors, (88), 30 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:58:53,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 98 transitions. [2022-04-15 12:58:53,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:58:53,751 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 12:58:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 12:58:53,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:58:53,751 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:58:53,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 12:58:53,752 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:58:53,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:58:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1644013284, now seen corresponding path program 28 times [2022-04-15 12:58:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:58:53,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320973768] [2022-04-15 12:58:53,792 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:58:53,794 INFO L85 PathProgramCache]: Analyzing trace with hash 480712879, now seen corresponding path program 1 times [2022-04-15 12:58:53,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:58:53,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835694084] [2022-04-15 12:58:53,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:58:53,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:58:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:58:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:58:54,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {11665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11659#true} is VALID [2022-04-15 12:58:54,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {11659#true} assume true; {11659#true} is VALID [2022-04-15 12:58:54,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11659#true} {11659#true} #42#return; {11659#true} is VALID [2022-04-15 12:58:54,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {11659#true} call ULTIMATE.init(); {11665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:58:54,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {11665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11659#true} is VALID [2022-04-15 12:58:54,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {11659#true} assume true; {11659#true} is VALID [2022-04-15 12:58:54,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11659#true} {11659#true} #42#return; {11659#true} is VALID [2022-04-15 12:58:54,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {11659#true} call #t~ret6 := main(); {11659#true} is VALID [2022-04-15 12:58:54,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {11659#true} ~x~0 := 0;~y~0 := 10000000;~z~0 := 5000000; {11664#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:58:54,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {11664#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [102] L10-2-->L10-3_primed: Formula: (or (and (= v_main_~x~0_In_28 v_main_~x~0_Out_56) (= v_main_~y~0_In_28 v_main_~y~0_In_28)) (let ((.cse0 (mod (+ 4294967295 v_main_~x~0_Out_56) 4294967296))) (and (= |v_main_#t~post5_Out_56| 0) (not (<= 5000000 .cse0)) (= v_main_~y~0_In_28 0) (< .cse0 (mod v_main_~y~0_In_28 4294967296)) (<= v_main_~x~0_In_28 v_main_~x~0_Out_56)))) InVars {main_~x~0=v_main_~x~0_In_28, main_~y~0=v_main_~y~0_In_28} OutVars{main_#t~post5=|v_main_#t~post5_Out_56|, main_~y~0=v_main_~y~0_In_28, main_~x~0=v_main_~x~0_Out_56} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {11664#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} is VALID [2022-04-15 12:58:54,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {11664#(and (= main_~x~0 0) (<= 10000000 main_~y~0) (<= (div main_~y~0 4294967296) 0))} [101] L10-3_primed-->L10-3: Formula: (not (< (mod v_main_~x~0_8 4294967296) (mod v_main_~y~0_3 4294967296))) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {11660#false} is VALID [2022-04-15 12:58:54,113 INFO L272 TraceCheckUtils]: 8: Hoare triple {11660#false} call __VERIFIER_assert((if ~z~0 % 4294967296 != ~x~0 % 4294967296 then 1 else 0)); {11660#false} is VALID [2022-04-15 12:58:54,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {11660#false} ~cond := #in~cond; {11660#false} is VALID [2022-04-15 12:58:54,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {11660#false} assume 0 == ~cond; {11660#false} is VALID [2022-04-15 12:58:54,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {11660#false} assume !false; {11660#false} is VALID [2022-04-15 12:58:54,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:58:54,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:58:54,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835694084] [2022-04-15 12:58:54,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835694084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:58:54,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:58:54,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:00:05,661 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320973768] [2022-04-15 13:00:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320973768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:05,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:05,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 13:00:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829008018] [2022-04-15 13:00:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 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 95 [2022-04-15 13:00:05,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:05,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 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 13:00:06,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:06,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 13:00:06,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:06,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 13:00:06,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:00:06,207 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand has 32 states, 32 states have (on average 2.84375) internal successors, (91), 31 states have internal predecessors, (91), 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)