/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:16:33,612 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:16:33,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:16:33,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:16:33,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:16:33,683 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:16:33,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:16:33,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:16:33,688 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:16:33,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:16:33,693 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:16:33,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:16:33,694 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:16:33,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:16:33,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:16:33,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:16:33,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:16:33,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:16:33,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:16:33,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:16:33,716 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:16:33,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:16:33,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:16:33,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:16:33,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:16:33,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:16:33,734 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:16:33,735 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:16:33,735 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:16:33,735 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:16:33,737 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:16:33,737 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:16:33,738 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:16:33,738 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:16:33,739 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:16:33,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:16:33,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:16:33,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:16:33,740 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:16:33,740 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:16:33,741 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:16:33,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:16:33,744 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:16:33,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:16:33,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:16:33,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:16:33,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:16:33,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:16:33,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:16:33,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:16:33,778 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:16:33,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:16:33,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:16:33,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:16:33,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:16:33,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:16:33,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:16:33,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:16:33,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:33,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:16:33,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:16:33,780 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:16:33,780 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:16:33,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:16:33,780 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:16:33,780 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:16:34,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:16:34,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:16:34,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:16:34,170 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:16:34,170 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:16:34,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-15 12:16:34,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d260908/f0485d66080340c9b3469c256baaeecb/FLAG6ba1a1e7a [2022-04-15 12:16:34,884 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:16:34,885 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2022-04-15 12:16:34,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d260908/f0485d66080340c9b3469c256baaeecb/FLAG6ba1a1e7a [2022-04-15 12:16:34,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d260908/f0485d66080340c9b3469c256baaeecb [2022-04-15 12:16:34,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:16:34,960 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:16:34,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:34,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:16:34,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:16:34,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:34" (1/1) ... [2022-04-15 12:16:34,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f21b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:34, skipping insertion in model container [2022-04-15 12:16:34,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:16:34" (1/1) ... [2022-04-15 12:16:34,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:16:35,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:16:35,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c[373,386] [2022-04-15 12:16:35,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:35,259 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:16:35,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c[373,386] [2022-04-15 12:16:35,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:16:35,287 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:16:35,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35 WrapperNode [2022-04-15 12:16:35,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:16:35,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:16:35,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:16:35,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:16:35,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:16:35,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:16:35,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:16:35,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:16:35,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (1/1) ... [2022-04-15 12:16:35,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:16:35,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:16:35,340 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:16:35,345 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:16:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:16:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:16:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:16:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:16:35,390 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:16:35,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:16:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:16:35,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:16:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:16:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:16:35,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:16:35,443 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:16:35,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:16:35,641 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:16:35,656 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:16:35,656 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:16:35,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:35 BoogieIcfgContainer [2022-04-15 12:16:35,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:16:35,659 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:16:35,659 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:16:35,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:16:35,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:16:34" (1/3) ... [2022-04-15 12:16:35,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19767d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:35, skipping insertion in model container [2022-04-15 12:16:35,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:16:35" (2/3) ... [2022-04-15 12:16:35,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19767d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:16:35, skipping insertion in model container [2022-04-15 12:16:35,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:16:35" (3/3) ... [2022-04-15 12:16:35,684 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2022-04-15 12:16:35,688 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:16:35,688 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:16:35,758 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:16:35,763 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:16:35,763 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:16:35,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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:16:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:16:35,779 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:35,779 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:35,780 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-15 12:16:35,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:35,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255819297] [2022-04-15 12:16:35,796 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 2 times [2022-04-15 12:16:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319327245] [2022-04-15 12:16:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:35,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:35,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:16:35,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:16:35,915 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-15 12:16:35,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:35,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:16:35,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:16:35,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-15 12:16:35,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-15 12:16:35,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-15 12:16:35,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:16:35,918 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-15 12:16:35,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 12:16:35,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 12:16:35,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:16:35,919 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:16:35,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:35,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319327245] [2022-04-15 12:16:35,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319327245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:35,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:35,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:35,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:35,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255819297] [2022-04-15 12:16:35,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255819297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:35,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:35,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:16:35,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723652] [2022-04-15 12:16:35,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:35,927 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:16:35,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:35,930 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:16:35,944 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:16:35,945 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:16:35,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:35,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:16:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:16:35,961 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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:16:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:36,022 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:16:36,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:16:36,023 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:16:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:36,024 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:16:36,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:16:36,029 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:16:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:16:36,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 12:16:36,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:36,092 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:16:36,093 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:16:36,095 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:16:36,098 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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:16:36,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:16:36,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:16:36,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:36,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:36,130 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:36,130 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:36,133 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:16:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:16:36,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:36,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:36,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:16:36,134 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:16:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:36,136 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:16:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:16:36,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:36,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:36,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:36,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:36,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:36,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 12:16:36,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 12:16:36,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:36,139 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 12:16:36,140 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:16:36,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 12:16:36,193 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:16:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:16:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:16:36,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:36,194 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:36,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:16:36,195 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:36,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-15 12:16:36,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:36,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635193533] [2022-04-15 12:16:36,197 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:16:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 2 times [2022-04-15 12:16:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:36,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828886320] [2022-04-15 12:16:36,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:36,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:36,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:16:36,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:16:36,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-15 12:16:36,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:36,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:16:36,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:16:36,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-15 12:16:36,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret6 := main(); {142#true} is VALID [2022-04-15 12:16:36,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {147#(= main_~x~0 0)} is VALID [2022-04-15 12:16:36,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {143#false} is VALID [2022-04-15 12:16:36,436 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-15 12:16:36,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 12:16:36,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 12:16:36,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 12:16:36,437 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:16:36,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:36,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828886320] [2022-04-15 12:16:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828886320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:36,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:36,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:36,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:36,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635193533] [2022-04-15 12:16:36,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635193533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:36,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:36,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:36,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324264488] [2022-04-15 12:16:36,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:36,440 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:16:36,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:36,440 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:16:36,457 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:16:36,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:16:36,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:36,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:16:36,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:16:36,459 INFO L87 Difference]: Start difference. First operand 13 states and 14 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:16:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:36,506 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 12:16:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:16:36,506 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:16:36,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:36,507 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:16:36,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 12:16:36,509 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:16:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-15 12:16:36,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-15 12:16:36,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:36,531 INFO L225 Difference]: With dead ends: 20 [2022-04-15 12:16:36,532 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:16:36,532 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:16:36,533 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:36,533 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:36,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:16:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-15 12:16:36,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:36,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 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:16:36,538 INFO L74 IsIncluded]: Start isIncluded. First operand 15 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:16:36,538 INFO L87 Difference]: Start difference. First operand 15 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:16:36,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:36,540 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 12:16:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 12:16:36,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:36,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:36,540 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 15 states. [2022-04-15 12:16:36,541 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 15 states. [2022-04-15 12:16:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:36,542 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 12:16:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 12:16:36,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:36,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:36,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:36,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:36,543 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:16:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-15 12:16:36,544 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-15 12:16:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:36,544 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-15 12:16:36,544 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:16:36,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-15 12:16:36,572 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:16:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-15 12:16:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:16:36,573 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:36,573 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:36,573 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:16:36,573 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-15 12:16:36,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:36,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1076554755] [2022-04-15 12:16:36,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash -230057778, now seen corresponding path program 1 times [2022-04-15 12:16:36,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:36,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080388748] [2022-04-15 12:16:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:36,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:36,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {257#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-15 12:16:36,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 12:16:36,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 12:16:36,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {257#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:36,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-15 12:16:36,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-15 12:16:36,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-15 12:16:36,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-15 12:16:36,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-15 12:16:36,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} [46] L18-2-->L17-2_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)) (and (not (= (mod v_main_~y~0_In_1 2) 0)) (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= v_main_~y~0_In_1 0) (= |v_main_#t~post5_Out_2| 0) (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 99))) 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] {256#(= main_~x~0 0)} is VALID [2022-04-15 12:16:36,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} [45] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {252#false} is VALID [2022-04-15 12:16:36,914 INFO L272 TraceCheckUtils]: 8: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-15 12:16:36,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-15 12:16:36,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-15 12:16:36,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-15 12:16:36,916 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:16:36,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:36,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080388748] [2022-04-15 12:16:36,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080388748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:36,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:36,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:36,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:36,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1076554755] [2022-04-15 12:16:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1076554755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:36,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:36,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:16:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304565171] [2022-04-15 12:16:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:36,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:16:36,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:36,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:36,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:36,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:16:37,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:37,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:16:37,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:16:37,001 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,143 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-04-15 12:16:37,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:16:37,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:16:37,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-15 12:16:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2022-04-15 12:16:37,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 29 transitions. [2022-04-15 12:16:37,192 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:16:37,195 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:16:37,195 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:16:37,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:16:37,198 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:37,202 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:16:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:16:37,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:37,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,208 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,209 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,210 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:16:37,210 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:16:37,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:37,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:37,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 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:16:37,212 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 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:16:37,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:37,214 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:16:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:16:37,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:37,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:37,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:37,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:16:37,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 12:16:37,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:37,218 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:16:37,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:16:37,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:16:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:16:37,251 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:37,251 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:37,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:16:37,253 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:37,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:37,260 INFO L85 PathProgramCache]: Analyzing trace with hash -454598811, now seen corresponding path program 1 times [2022-04-15 12:16:37,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:37,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780191958] [2022-04-15 12:16:37,360 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash -170952434, now seen corresponding path program 1 times [2022-04-15 12:16:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:37,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386716050] [2022-04-15 12:16:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:37,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:37,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {391#(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(14, 2);call #Ultimate.allocInit(12, 3); {381#true} is VALID [2022-04-15 12:16:37,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2022-04-15 12:16:37,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #42#return; {381#true} is VALID [2022-04-15 12:16:37,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:37,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#(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(14, 2);call #Ultimate.allocInit(12, 3); {381#true} is VALID [2022-04-15 12:16:37,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#true} assume true; {381#true} is VALID [2022-04-15 12:16:37,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {381#true} {381#true} #42#return; {381#true} is VALID [2022-04-15 12:16:37,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {381#true} call #t~ret6 := main(); {381#true} is VALID [2022-04-15 12:16:37,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {386#(= main_~x~0 0)} is VALID [2022-04-15 12:16:37,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(= main_~x~0 0)} [48] L18-2-->L17-2_primed: Formula: (or (and (= (mod (+ v_main_~x~0_Out_4 v_main_~x~0_In_2) 2) 0) (<= 0 (div (+ (* v_main_~x~0_Out_4 (- 1)) v_main_~x~0_In_2) (- 2))) (< (mod (+ v_main_~x~0_Out_4 4294967294) 4294967296) 99) (= 0 (* 2 v_main_~y~0_In_2)) (= (mod v_main_~y~0_In_2 2) 0)) (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))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_2} OutVars{main_~x~0=v_main_~x~0_Out_4, main_~y~0=v_main_~y~0_In_2} AuxVars[] AssignedVars[main_~x~0] {387#(or (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))) (<= main_~x~0 (+ 98 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-15 12:16:37,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(or (and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1))) (<= main_~x~0 (+ 98 (* 4294967296 (div main_~x~0 4294967296)))))} [47] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {388#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} is VALID [2022-04-15 12:16:37,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {388#(and (<= (+ main_~y~0 (* (div main_~x~0 2) 2)) (+ (* (div main_~y~0 2) 2) main_~x~0)) (< (+ (* (div main_~y~0 2) 2) main_~x~0) (+ main_~y~0 (* (div main_~x~0 2) 2) 1)))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {389#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:16:37,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {390#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:16:37,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {390#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {382#false} is VALID [2022-04-15 12:16:37,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {382#false} assume !false; {382#false} is VALID [2022-04-15 12:16:37,550 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:16:37,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386716050] [2022-04-15 12:16:37,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386716050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:37,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:37,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:16:37,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:37,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780191958] [2022-04-15 12:16:37,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780191958] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:37,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:37,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:16:37,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366231942] [2022-04-15 12:16:37,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:37,697 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:16:37,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:37,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:37,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:37,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:16:37,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:37,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:16:37,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:16:37,712 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,163 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-15 12:16:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:16:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:16:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:38,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 12:16:38,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2022-04-15 12:16:38,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2022-04-15 12:16:38,219 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:16:38,220 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:16:38,220 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:16:38,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:16:38,221 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:38,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:16:38,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:16:38,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:38,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,238 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,238 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,239 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 12:16:38,239 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:16:38,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:38,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:38,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:16:38,240 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:16:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,241 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 12:16:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:16:38,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:38,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:38,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:38,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-15 12:16:38,243 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-04-15 12:16:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:38,243 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-15 12:16:38,243 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-15 12:16:38,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:16:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:16:38,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:38,272 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:38,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:16:38,273 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 2 times [2022-04-15 12:16:38,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:38,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1862506457] [2022-04-15 12:16:38,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:38,329 INFO L85 PathProgramCache]: Analyzing trace with hash -111847090, now seen corresponding path program 1 times [2022-04-15 12:16:38,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:38,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095015428] [2022-04-15 12:16:38,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:38,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#(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(14, 2);call #Ultimate.allocInit(12, 3); {557#true} is VALID [2022-04-15 12:16:38,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {557#true} assume true; {557#true} is VALID [2022-04-15 12:16:38,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {557#true} {557#true} #42#return; {557#true} is VALID [2022-04-15 12:16:38,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {557#true} call ULTIMATE.init(); {563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:38,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#(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(14, 2);call #Ultimate.allocInit(12, 3); {557#true} is VALID [2022-04-15 12:16:38,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {557#true} assume true; {557#true} is VALID [2022-04-15 12:16:38,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {557#true} {557#true} #42#return; {557#true} is VALID [2022-04-15 12:16:38,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {557#true} call #t~ret6 := main(); {557#true} is VALID [2022-04-15 12:16:38,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {557#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {562#(= main_~x~0 0)} is VALID [2022-04-15 12:16:38,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {562#(= main_~x~0 0)} [50] L18-2-->L17-2_primed: Formula: (or (and (< (mod (+ v_main_~x~0_Out_6 4294967295) 4294967296) 99) (= v_main_~y~0_In_3 0) (= |v_main_#t~post5_Out_4| 0) (not (= (mod v_main_~y~0_In_3 2) 0)) (<= v_main_~x~0_In_3 v_main_~x~0_Out_6)) (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))) 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_4|, 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] {562#(= main_~x~0 0)} is VALID [2022-04-15 12:16:38,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {562#(= main_~x~0 0)} [49] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {558#false} is VALID [2022-04-15 12:16:38,436 INFO L272 TraceCheckUtils]: 8: Hoare triple {558#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {558#false} is VALID [2022-04-15 12:16:38,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {558#false} ~cond := #in~cond; {558#false} is VALID [2022-04-15 12:16:38,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {558#false} assume 0 == ~cond; {558#false} is VALID [2022-04-15 12:16:38,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {558#false} assume !false; {558#false} is VALID [2022-04-15 12:16:38,437 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:16:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:38,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095015428] [2022-04-15 12:16:38,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095015428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:38,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:38,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:38,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:38,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1862506457] [2022-04-15 12:16:38,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1862506457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:38,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:38,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:16:38,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633506795] [2022-04-15 12:16:38,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:38,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:16:38,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:38,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,488 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:16:38,488 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:16:38,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:38,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:16:38,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:16:38,489 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,602 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 12:16:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:16:38,603 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:16:38,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-15 12:16:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2022-04-15 12:16:38,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2022-04-15 12:16:38,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:38,632 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:16:38,632 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:16:38,633 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:16:38,633 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:38,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:16:38,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:16:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:16:38,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:38,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:16:38,648 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:16:38,648 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:16:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,650 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 12:16:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 12:16:38,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:38,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:38,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 23 states. [2022-04-15 12:16:38,650 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 23 states. [2022-04-15 12:16:38,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:38,651 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-15 12:16:38,651 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 12:16:38,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:38,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:38,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:38,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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:16:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 12:16:38,652 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2022-04-15 12:16:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:38,653 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 12:16:38,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 12:16:38,688 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:16:38,689 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 12:16:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:16:38,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:38,689 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:38,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 12:16:38,690 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:38,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:38,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 3 times [2022-04-15 12:16:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:38,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961090995] [2022-04-15 12:16:38,733 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:16:38,735 INFO L85 PathProgramCache]: Analyzing trace with hash -52741746, now seen corresponding path program 1 times [2022-04-15 12:16:38,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:16:38,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733965371] [2022-04-15 12:16:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:16:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:16:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:16:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:16:38,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {732#(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(14, 2);call #Ultimate.allocInit(12, 3); {726#true} is VALID [2022-04-15 12:16:38,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} assume true; {726#true} is VALID [2022-04-15 12:16:38,795 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {726#true} {726#true} #42#return; {726#true} is VALID [2022-04-15 12:16:38,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {726#true} call ULTIMATE.init(); {732#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:16:38,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#(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(14, 2);call #Ultimate.allocInit(12, 3); {726#true} is VALID [2022-04-15 12:16:38,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {726#true} assume true; {726#true} is VALID [2022-04-15 12:16:38,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {726#true} {726#true} #42#return; {726#true} is VALID [2022-04-15 12:16:38,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {726#true} call #t~ret6 := main(); {726#true} is VALID [2022-04-15 12:16:38,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {726#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {731#(= main_~x~0 0)} is VALID [2022-04-15 12:16:38,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {731#(= main_~x~0 0)} [52] L18-2-->L17-2_primed: Formula: (or (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)) (and (not (= (mod v_main_~y~0_In_4 2) 0)) (= |v_main_#t~post5_Out_6| 0) (< (mod (+ v_main_~x~0_Out_8 4294967295) 4294967296) 99) (= v_main_~y~0_In_4 0) (<= v_main_~x~0_In_4 v_main_~x~0_Out_8))) 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_6|, 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] {731#(= main_~x~0 0)} is VALID [2022-04-15 12:16:38,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {731#(= main_~x~0 0)} [51] L17-2_primed-->L17-2: Formula: (not (< (mod v_main_~x~0_5 4294967296) 99)) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {727#false} is VALID [2022-04-15 12:16:38,798 INFO L272 TraceCheckUtils]: 8: Hoare triple {727#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {727#false} is VALID [2022-04-15 12:16:38,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#false} ~cond := #in~cond; {727#false} is VALID [2022-04-15 12:16:38,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#false} assume 0 == ~cond; {727#false} is VALID [2022-04-15 12:16:38,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {727#false} assume !false; {727#false} is VALID [2022-04-15 12:16:38,799 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:16:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:16:38,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733965371] [2022-04-15 12:16:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733965371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:38,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:16:38,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:16:38,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961090995] [2022-04-15 12:16:38,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961090995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:16:38,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:16:38,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:16:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811988418] [2022-04-15 12:16:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:16:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:16:38,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:16:38,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:38,865 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:16:38,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:16:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:16:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:16:38,866 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:39,023 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-15 12:16:39,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:16:39,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:16:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:16:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:16:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-04-15 12:16:39,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-04-15 12:16:39,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,052 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:16:39,052 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:16:39,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 4 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:16:39,053 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:16:39,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:16:39,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:16:39,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:16:39,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:16:39,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,070 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,070 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:39,071 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 12:16:39,071 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:16:39,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:39,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:39,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:16:39,072 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 12:16:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:16:39,073 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 12:16:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:16:39,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:16:39,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:16:39,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:16:39,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:16:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-15 12:16:39,074 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2022-04-15 12:16:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:16:39,074 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-15 12:16:39,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:16:39,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-15 12:16:39,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:16:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:16:39,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:16:39,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:16:39,104 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:16:39,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 12:16:39,116 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:16:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:16:39,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1088949283, now seen corresponding path program 1 times [2022-04-15 12:16:39,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:16:39,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [114878937] [2022-04-15 12:16:39,266 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 12:16:39,269 INFO L158 Benchmark]: Toolchain (without parser) took 4309.53ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 153.7MB in the beginning and 178.9MB in the end (delta: -25.2MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-15 12:16:39,270 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:16:39,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.19ms. Allocated memory is still 174.1MB. Free memory was 153.5MB in the beginning and 150.7MB in the end (delta: 2.7MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2022-04-15 12:16:39,270 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 174.1MB. Free memory was 150.7MB in the beginning and 149.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:16:39,270 INFO L158 Benchmark]: RCFGBuilder took 340.34ms. Allocated memory is still 174.1MB. Free memory was 149.4MB in the beginning and 138.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 12:16:39,270 INFO L158 Benchmark]: TraceAbstraction took 3609.79ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 137.9MB in the beginning and 178.9MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:16:39,273 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 174.1MB. Free memory is still 138.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 326.19ms. Allocated memory is still 174.1MB. Free memory was 153.5MB in the beginning and 150.7MB in the end (delta: 2.7MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 174.1MB. Free memory was 150.7MB in the beginning and 149.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 340.34ms. Allocated memory is still 174.1MB. Free memory was 149.4MB in the beginning and 138.6MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3609.79ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 137.9MB in the beginning and 178.9MB in the end (delta: -41.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:16:39,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...