/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/underapprox_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:18:18,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:18:18,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:18:18,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:18:18,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:18:18,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:18:18,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:18:18,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:18:18,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:18:18,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:18:18,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:18:18,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:18:18,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:18:18,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:18:18,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:18:18,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:18:18,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:18:18,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:18:18,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:18:18,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:18:18,926 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:18:18,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:18:18,928 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:18:18,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:18:18,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:18:18,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:18:18,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:18:18,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:18:18,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:18:18,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:18:18,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:18:18,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:18:18,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:18:18,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:18:18,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:18:18,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:18:18,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:18:18,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:18:18,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:18:18,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:18:18,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:18:18,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:18:18,950 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:18:18,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:18:18,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:18:18,966 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:18:18,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:18:18,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:18:18,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:18:18,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:18:18,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:18:18,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:18:18,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:18:18,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:18:18,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:18:18,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:18:18,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:18:18,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:18:18,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:18,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:18:18,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:18:18,969 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:18:18,969 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:18:18,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:18:18,969 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:18:18,969 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:18:19,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:18:19,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:18:19,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:18:19,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:18:19,207 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:18:19,208 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-15 12:18:19,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee09ce207/275b6f837fb24871985e7ad0145185bc/FLAG565edfa62 [2022-04-15 12:18:19,643 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:18:19,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-15 12:18:19,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee09ce207/275b6f837fb24871985e7ad0145185bc/FLAG565edfa62 [2022-04-15 12:18:20,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee09ce207/275b6f837fb24871985e7ad0145185bc [2022-04-15 12:18:20,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:18:20,064 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:18:20,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:20,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:18:20,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:18:20,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b02656e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20, skipping insertion in model container [2022-04-15 12:18:20,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:18:20,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:18:20,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c[327,340] [2022-04-15 12:18:20,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:20,230 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:18:20,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c[327,340] [2022-04-15 12:18:20,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:18:20,255 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:18:20,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20 WrapperNode [2022-04-15 12:18:20,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:18:20,257 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:18:20,257 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:18:20,257 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:18:20,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,280 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:18:20,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:18:20,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:18:20,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:18:20,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (1/1) ... [2022-04-15 12:18:20,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:18:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:18:20,316 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:18:20,320 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:18:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:18:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:18:20,346 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:18:20,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:18:20,347 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:18:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:18:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:18:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:18:20,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:18:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:18:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:18:20,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:18:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:18:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:18:20,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:18:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:18:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:18:20,398 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:18:20,399 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:18:20,531 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:18:20,551 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:18:20,551 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:18:20,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:20 BoogieIcfgContainer [2022-04-15 12:18:20,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:18:20,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:18:20,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:18:20,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:18:20,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:18:20" (1/3) ... [2022-04-15 12:18:20,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792cbb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:20, skipping insertion in model container [2022-04-15 12:18:20,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:18:20" (2/3) ... [2022-04-15 12:18:20,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@792cbb74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:18:20, skipping insertion in model container [2022-04-15 12:18:20,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:18:20" (3/3) ... [2022-04-15 12:18:20,561 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-1.c [2022-04-15 12:18:20,565 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:18:20,566 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:18:20,649 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:18:20,654 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:18:20,655 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:18:20,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:18:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:20,697 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:20,698 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:20,698 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:20,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:20,711 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-15 12:18:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:20,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310687747] [2022-04-15 12:18:20,730 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-15 12:18:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:20,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338246279] [2022-04-15 12:18:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:20,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:20,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:20,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:18:20,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:20,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-15 12:18:20,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-15 12:18:20,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-15 12:18:20,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-15 12:18:20,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-15 12:18:20,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-15 12:18:20,953 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-15 12:18:20,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-15 12:18:20,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-15 12:18:20,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-15 12:18:20,954 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:18:20,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:20,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338246279] [2022-04-15 12:18:20,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338246279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:20,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:20,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:18:20,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:20,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310687747] [2022-04-15 12:18:20,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310687747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:20,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:20,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:18:20,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988879724] [2022-04-15 12:18:20,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:20,965 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:18:20,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:20,969 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:18:20,989 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:18:20,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:18:20,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:18:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:18:21,015 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:21,106 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 12:18:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:18:21,106 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:18:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:21,107 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:18:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:18:21,118 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:18:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-15 12:18:21,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-15 12:18:21,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:21,180 INFO L225 Difference]: With dead ends: 29 [2022-04-15 12:18:21,180 INFO L226 Difference]: Without dead ends: 12 [2022-04-15 12:18:21,183 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:18:21,188 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:21,190 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:21,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-15 12:18:21,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-15 12:18:21,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:21,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,224 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,225 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:21,231 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:18:21,231 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:21,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:21,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:21,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:18:21,233 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-15 12:18:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:21,235 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-15 12:18:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:21,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:21,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:21,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:21,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 12:18:21,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-15 12:18:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:21,241 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 12:18:21,241 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:18:21,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 12:18:21,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:21,265 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 12:18:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:18:21,266 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:21,267 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:21,268 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:18:21,271 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:21,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:21,277 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-15 12:18:21,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:21,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791075536] [2022-04-15 12:18:21,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:18:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-15 12:18:21,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:21,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166185721] [2022-04-15 12:18:21,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:21,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:21,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:21,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:18:21,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:18:21,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:18:21,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:21,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-15 12:18:21,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-15 12:18:21,399 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-15 12:18:21,399 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-15 12:18:21,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-15 12:18:21,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-15 12:18:21,400 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {136#false} is VALID [2022-04-15 12:18:21,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-15 12:18:21,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-15 12:18:21,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-15 12:18:21,401 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:18:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:21,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166185721] [2022-04-15 12:18:21,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166185721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:21,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:21,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:21,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:21,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791075536] [2022-04-15 12:18:21,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791075536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:21,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:21,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:18:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492986000] [2022-04-15 12:18:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:21,404 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:18:21,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:21,404 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:18:21,417 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:18:21,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:18:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:21,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:18:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:18:21,421 INFO L87 Difference]: Start difference. First operand 12 states and 12 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:18:21,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:21,488 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 12:18:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:18:21,489 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:18:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:21,536 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:18:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:18:21,538 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:18:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-15 12:18:21,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-15 12:18:21,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:21,580 INFO L225 Difference]: With dead ends: 18 [2022-04-15 12:18:21,580 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:18:21,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:18:21,581 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:21,582 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:18:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:18:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:18:21,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:21,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,586 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,586 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:21,588 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:21,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:21,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:21,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:18:21,589 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:18:21,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:21,590 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 12:18:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:21,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:21,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:21,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:21,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:21,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:21,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 12:18:21,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 12:18:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:21,592 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 12:18:21,592 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:18:21,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 12:18:21,606 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:18:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 12:18:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:18:21,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:21,607 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:21,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:18:21,607 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:21,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:21,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-15 12:18:21,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:21,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1478334936] [2022-04-15 12:18:21,940 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-15 12:18:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:21,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695294722] [2022-04-15 12:18:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:21,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:22,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:22,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:22,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:22,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {234#true} is VALID [2022-04-15 12:18:22,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-15 12:18:22,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-15 12:18:22,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret5 := main(); {234#true} is VALID [2022-04-15 12:18:22,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0;~y~0 := 1; {239#(= main_~x~0 0)} is VALID [2022-04-15 12:18:22,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} [40] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_1 v_main_~y~0_Out_2))) (or (and .cse0 (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) .cse0 (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 6) (= (mod v_main_~y~0_Out_2 2) 0) (= v_main_~y~0_Out_2 0)))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post4=|v_main_#t~post4_Out_2|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {240#(or (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-15 12:18:22,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(or (= main_~x~0 0) (= main_~y~0 0))} [39] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {241#(= main_~y~0 0)} is VALID [2022-04-15 12:18:22,054 INFO L272 TraceCheckUtils]: 8: Hoare triple {241#(= main_~y~0 0)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {242#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:22,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {243#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:22,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {243#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-15 12:18:22,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-15 12:18:22,056 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:18:22,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:22,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695294722] [2022-04-15 12:18:22,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695294722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:22,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:22,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:18:22,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:22,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1478334936] [2022-04-15 12:18:22,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1478334936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:22,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:22,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:18:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185999522] [2022-04-15 12:18:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:18:22,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:22,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:18:22,202 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:18:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:22,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:18:22,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:18:22,204 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:22,557 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:18:22,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:18:22,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:18:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:18:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-04-15 12:18:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 19 transitions. [2022-04-15 12:18:22,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 19 transitions. [2022-04-15 12:18:22,607 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:18:22,608 INFO L225 Difference]: With dead ends: 19 [2022-04-15 12:18:22,609 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 12:18:22,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:18:22,610 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:18:22,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:18:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 12:18:22,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 12:18:22,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:18:22,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,618 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,618 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:22,619 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:18:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:22,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:22,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:22,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:18:22,620 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 12:18:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:18:22,621 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 12:18:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:22,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:18:22,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:18:22,621 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:18:22,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:18:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 12:18:22,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 12:18:22,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:18:22,625 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 12:18:22,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:22,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 12:18:22,639 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:18:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 12:18:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:18:22,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:18:22,640 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:18:22,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:18:22,641 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:18:22,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:18:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 2 times [2022-04-15 12:18:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:18:22,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [826161987] [2022-04-15 12:18:22,894 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:18:22,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-15 12:18:22,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:18:22,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684538133] [2022-04-15 12:18:22,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:18:22,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:18:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:18:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:18:22,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {353#true} is VALID [2022-04-15 12:18:22,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 12:18:22,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {353#true} {353#true} #34#return; {353#true} is VALID [2022-04-15 12:18:22,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {353#true} call ULTIMATE.init(); {361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:18:22,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {353#true} is VALID [2022-04-15 12:18:22,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {353#true} assume true; {353#true} is VALID [2022-04-15 12:18:22,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {353#true} {353#true} #34#return; {353#true} is VALID [2022-04-15 12:18:22,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {353#true} call #t~ret5 := main(); {353#true} is VALID [2022-04-15 12:18:22,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {353#true} ~x~0 := 0;~y~0 := 1; {358#(= main_~y~0 1)} is VALID [2022-04-15 12:18:22,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {358#(= main_~y~0 1)} [42] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) (or (and (= v_main_~y~0_Out_4 0) (< (mod (+ v_main_~x~0_Out_4 4294967295) 4294967296) 6) (<= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= (mod v_main_~y~0_Out_4 2) 0) .cse0) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) .cse0))) InVars {main_~x~0=v_main_~x~0_In_2, main_~y~0=v_main_~y~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {358#(= main_~y~0 1)} is VALID [2022-04-15 12:18:22,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {358#(= main_~y~0 1)} [41] L16-3_primed-->L16-3: Formula: (not (< (mod v_main_~x~0_4 4294967296) 6)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {358#(= main_~y~0 1)} is VALID [2022-04-15 12:18:22,961 INFO L272 TraceCheckUtils]: 8: Hoare triple {358#(= main_~y~0 1)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {359#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:18:22,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {359#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {360#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:18:22,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {360#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {354#false} is VALID [2022-04-15 12:18:22,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {354#false} assume !false; {354#false} is VALID [2022-04-15 12:18:22,964 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:18:22,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:18:22,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684538133] [2022-04-15 12:18:22,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684538133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:22,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:22,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:18:23,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:18:23,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [826161987] [2022-04-15 12:18:23,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [826161987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:18:23,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:18:23,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:18:23,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20632514] [2022-04-15 12:18:23,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:18:23,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:18:23,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:18:23,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:18:23,033 WARN L143 InductivityCheck]: Transition 363#(and (= main_~y~0 4) (< (mod (+ main_~x~0 4294967295) 4294967296) 6) (< (mod (+ main_~x~0 4294967294) 4294967296) 6)) ( _ , assume !(~x~0 % 4294967296 < 6); , 358#(= main_~y~0 1) ) not inductive [2022-04-15 12:18:23,033 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 12:18:23,034 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) 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:18:23,037 INFO L158 Benchmark]: Toolchain (without parser) took 2973.33ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 123.7MB in the beginning and 105.4MB in the end (delta: 18.3MB). Peak memory consumption was 52.3MB. Max. memory is 8.0GB. [2022-04-15 12:18:23,038 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 139.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:18:23,038 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.50ms. Allocated memory is still 173.0MB. Free memory was 123.5MB in the beginning and 149.1MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:18:23,039 INFO L158 Benchmark]: Boogie Preprocessor took 25.39ms. Allocated memory is still 173.0MB. Free memory was 149.1MB in the beginning and 147.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:18:23,039 INFO L158 Benchmark]: RCFGBuilder took 270.08ms. Allocated memory is still 173.0MB. Free memory was 147.6MB in the beginning and 137.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 12:18:23,039 INFO L158 Benchmark]: TraceAbstraction took 2482.01ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 137.5MB in the beginning and 105.4MB in the end (delta: 32.2MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2022-04-15 12:18:23,041 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 173.0MB. Free memory was 140.0MB in the beginning and 139.8MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.50ms. Allocated memory is still 173.0MB. Free memory was 123.5MB in the beginning and 149.1MB in the end (delta: -25.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.39ms. Allocated memory is still 173.0MB. Free memory was 149.1MB in the beginning and 147.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 270.08ms. Allocated memory is still 173.0MB. Free memory was 147.6MB in the beginning and 137.9MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2482.01ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 137.5MB in the beginning and 105.4MB in the end (delta: 32.2MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:18:23,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...