/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/phases_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:17:36,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:17:36,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:17:36,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:17:36,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:17:36,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:17:36,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:17:36,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:17:36,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:17:36,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:17:36,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:17:36,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:17:36,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:17:36,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:17:36,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:17:36,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:17:36,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:17:36,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:17:36,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:17:36,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:17:36,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:17:36,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:17:36,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:17:36,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:17:36,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:17:36,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:17:36,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:17:36,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:17:36,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:17:36,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:17:36,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:17:36,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:17:36,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:17:36,417 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:17:36,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:17:36,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:17:36,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:17:36,419 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:17:36,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:17:36,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:17:36,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:17:36,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:17:36,423 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:17:36,434 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:17:36,435 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:17:36,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:17:36,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:17:36,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:17:36,436 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:17:36,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:17:36,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:17:36,437 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:17:36,437 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:17:36,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:36,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:17:36,438 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:17:36,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:17:36,439 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:17:36,439 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:17:36,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:17:36,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:17:36,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:17:36,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:17:36,851 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:17:36,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2022-04-15 12:17:36,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f275417e0/a7b0c8bb3b7747169e30af0f9b3deec8/FLAG592b02ebb [2022-04-15 12:17:37,392 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:17:37,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_2-2.c [2022-04-15 12:17:37,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f275417e0/a7b0c8bb3b7747169e30af0f9b3deec8/FLAG592b02ebb [2022-04-15 12:17:37,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f275417e0/a7b0c8bb3b7747169e30af0f9b3deec8 [2022-04-15 12:17:37,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:17:37,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:17:37,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:37,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:17:37,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:17:37,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:37" (1/1) ... [2022-04-15 12:17:37,828 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b71079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:37, skipping insertion in model container [2022-04-15 12:17:37,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:17:37" (1/1) ... [2022-04-15 12:17:37,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:17:37,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:17:38,105 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/phases_2-2.c[459,472] [2022-04-15 12:17:38,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:38,170 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:17:38,196 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/phases_2-2.c[459,472] [2022-04-15 12:17:38,215 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:17:38,234 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:17:38,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38 WrapperNode [2022-04-15 12:17:38,246 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:17:38,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:17:38,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:17:38,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:17:38,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:17:38,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:17:38,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:17:38,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:17:38,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (1/1) ... [2022-04-15 12:17:38,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:17:38,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:38,393 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:17:38,412 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:17:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:17:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:17:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:17:38,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:17:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:17:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:17:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:17:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:17:38,469 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:17:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:17:38,470 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:17:38,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 12:17:38,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:17:38,484 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:17:38,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:17:38,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:17:38,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:17:38,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:17:38,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:17:38,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:17:38,574 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:17:38,584 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:17:38,908 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:17:38,926 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:17:38,926 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:17:38,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:38 BoogieIcfgContainer [2022-04-15 12:17:38,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:17:38,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:17:38,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:17:38,945 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:17:38,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:17:37" (1/3) ... [2022-04-15 12:17:38,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b955c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:38, skipping insertion in model container [2022-04-15 12:17:38,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:17:38" (2/3) ... [2022-04-15 12:17:38,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8b955c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:17:38, skipping insertion in model container [2022-04-15 12:17:38,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:17:38" (3/3) ... [2022-04-15 12:17:38,948 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_2-2.c [2022-04-15 12:17:38,951 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:17:38,952 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:17:39,064 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:17:39,070 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:17:39,070 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:17:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:17:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:17:39,115 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:39,115 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:39,116 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash -36402350, now seen corresponding path program 1 times [2022-04-15 12:17:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:39,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [619515685] [2022-04-15 12:17:39,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:17:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -36402350, now seen corresponding path program 2 times [2022-04-15 12:17:39,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:39,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123597156] [2022-04-15 12:17:39,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:17:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:39,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 12:17:39,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:17:39,812 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-15 12:17:39,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:17:39,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(13, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-15 12:17:39,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 12:17:39,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #54#return; {23#true} is VALID [2022-04-15 12:17:39,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret6 := main(); {23#true} is VALID [2022-04-15 12:17:39,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 1;~y~0 := #t~nondet4;havoc #t~nondet4; {28#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:17:39,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#(= (+ (- 1) main_~x~0) 0)} assume !!(~y~0 % 4294967296 > 0); {29#(and (= (+ (- 1) main_~x~0) 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:17:39,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(and (= (+ (- 1) main_~x~0) 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {30#(and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div main_~y~0 4294967296) 4294967296) main_~x~0)) (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 12:17:39,835 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div main_~y~0 4294967296) 4294967296) main_~x~0)) (= main_~x~0 1) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:17:39,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:17:39,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {24#false} is VALID [2022-04-15 12:17:39,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 12:17:39,838 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:17:39,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:39,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123597156] [2022-04-15 12:17:39,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123597156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:39,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:39,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:39,858 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [619515685] [2022-04-15 12:17:39,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [619515685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:39,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:39,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661272972] [2022-04-15 12:17:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:39,865 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:17:39,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:39,870 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:17:39,903 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:17:39,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:17:39,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:39,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:17:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:17:39,945 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 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:17:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,631 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-15 12:17:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:17:40,632 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:17:40,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:40,633 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:17:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-04-15 12:17:40,663 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:17:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-04-15 12:17:40,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2022-04-15 12:17:40,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:40,768 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:17:40,769 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:17:40,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:17:40,788 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:40,790 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 50 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:17:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:17:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 12:17:40,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:40,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:40,858 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:40,859 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,870 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 12:17:40,870 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 12:17:40,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:40,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:40,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:17:40,872 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:17:40,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:40,878 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 12:17:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 12:17:40,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:40,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:40,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:40,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 12:17:40,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 12:17:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:40,881 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 12:17:40,896 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:17:40,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 12:17:40,916 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:17:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 12:17:40,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:17:40,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:17:40,939 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:17:40,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:17:40,940 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:17:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:17:40,941 INFO L85 PathProgramCache]: Analyzing trace with hash 476304909, now seen corresponding path program 1 times [2022-04-15 12:17:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:40,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949261370] [2022-04-15 12:17:41,110 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:17:41,113 INFO L85 PathProgramCache]: Analyzing trace with hash -63328336, now seen corresponding path program 1 times [2022-04-15 12:17:41,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:17:41,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097610980] [2022-04-15 12:17:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:41,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:17:41,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 12:17:41,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138089953] [2022-04-15 12:17:41,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:17:41,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:41,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:17:41,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:17:41,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:17:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:41,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:17:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:17:41,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:17:42,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-15 12:17:42,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {196#true} is VALID [2022-04-15 12:17:42,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-15 12:17:42,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #54#return; {196#true} is VALID [2022-04-15 12:17:42,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret6 := main(); {196#true} is VALID [2022-04-15 12:17:42,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 1;~y~0 := #t~nondet4;havoc #t~nondet4; {216#(= main_~x~0 1)} is VALID [2022-04-15 12:17:42,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {216#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {220#(and (= main_~x~0 1) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:17:42,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {220#(and (= main_~x~0 1) (< 0 (mod main_~y~0 4294967296)))} [58] L24-2-->L23-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)) (let ((.cse0 (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296)) (.cse1 (mod v_main_~y~0_In_1 4294967296))) (and (not (< .cse0 (mod (div .cse1 .cse0) 4294967296))) (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (< .cse0 .cse1) (= v_main_~y~0_In_1 0) (= |v_main_#t~post5_Out_2| 0)))) InVars {main_~x~0=v_main_~x~0_In_1, main_~y~0=v_main_~y~0_In_1} OutVars{main_#t~post5=|v_main_#t~post5_Out_2|, main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_Out_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post5] {220#(and (= main_~x~0 1) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:17:42,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {220#(and (= main_~x~0 1) (< 0 (mod main_~y~0 4294967296)))} [57] L23-2_primed-->L23-2: Formula: (not (< (mod v_main_~x~0_2 4294967296) (mod v_main_~y~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[] {227#(and (= main_~x~0 1) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 12:17:42,110 INFO L272 TraceCheckUtils]: 9: Hoare triple {227#(and (= main_~x~0 1) (not (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:17:42,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:17:42,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {197#false} is VALID [2022-04-15 12:17:42,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-15 12:17:42,112 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:17:42,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 12:17:42,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:17:42,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097610980] [2022-04-15 12:17:42,112 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 12:17:42,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138089953] [2022-04-15 12:17:42,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138089953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:42,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:42,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:17:42,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:17:42,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949261370] [2022-04-15 12:17:42,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949261370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:17:42,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:17:42,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:17:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156968603] [2022-04-15 12:17:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:17:42,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:17:42,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:17:42,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:42,217 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:17:42,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:17:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:17:42,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:17:42,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:17:42,233 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:42,316 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:17:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:17:42,316 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:17:42,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:17:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:42,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:17:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 12:17:42,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 12:17:42,357 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:17:42,357 INFO L225 Difference]: With dead ends: 17 [2022-04-15 12:17:42,358 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:17:42,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:17:42,361 INFO L913 BasicCegarLoop]: 7 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:17:42,365 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:17:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:17:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:17:42,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:17:42,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:17:42,367 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:17:42,368 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:17:42,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:42,368 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:17:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:17:42,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:42,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:42,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:17:42,368 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:17:42,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:17:42,369 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:17:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:17:42,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:42,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:17:42,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:17:42,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:17:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:17:42,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:17:42,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-15 12:17:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:17:42,370 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:17:42,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:17:42,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:17:42,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:17:42,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:17:42,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:17:42,373 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:17:42,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:17:42,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:17:42,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:17:42,811 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:17:42,811 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:17:42,811 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:17:42,811 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2022-04-15 12:17:42,811 INFO L882 garLoopResultBuilder]: For program point L6(line 6) no Hoare annotation was computed. [2022-04-15 12:17:42,811 INFO L882 garLoopResultBuilder]: For program point L6-2(lines 5 7) no Hoare annotation was computed. [2022-04-15 12:17:42,812 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2022-04-15 12:17:42,812 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 17 32) the Hoare annotation is: true [2022-04-15 12:17:42,812 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 17 32) the Hoare annotation is: true [2022-04-15 12:17:42,812 INFO L878 garLoopResultBuilder]: At program point L24(lines 24 28) the Hoare annotation is: (and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296))) [2022-04-15 12:17:42,812 INFO L878 garLoopResultBuilder]: At program point L24-2(lines 23 29) the Hoare annotation is: (and (= main_~x~0 1) (< 0 (mod main_~y~0 4294967296))) [2022-04-15 12:17:42,812 INFO L878 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: (= main_~x~0 1) [2022-04-15 12:17:42,813 INFO L878 garLoopResultBuilder]: At program point L23-2(lines 23 29) the Hoare annotation is: (let ((.cse0 (* (div main_~y~0 4294967296) 4294967296))) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ .cse0 main_~x~0)) (= main_~x~0 1) (<= (+ .cse0 1) main_~y~0))) [2022-04-15 12:17:42,816 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 17 32) the Hoare annotation is: true [2022-04-15 12:17:42,816 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 12:17:42,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 10 15) the Hoare annotation is: true [2022-04-15 12:17:42,818 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:17:42,818 INFO L878 garLoopResultBuilder]: At program point L11(lines 11 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:17:42,818 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 10 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:17:42,819 INFO L878 garLoopResultBuilder]: At program point L11-2(lines 10 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:17:42,819 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:17:42,835 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1] [2022-04-15 12:17:42,837 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:17:42,849 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:17:42,850 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 12:17:42,851 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:17:42,851 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 12:17:42,851 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-15 12:17:42,852 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-15 12:17:42,857 INFO L163 areAnnotationChecker]: CFG has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:17:42,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:17:42 BoogieIcfgContainer [2022-04-15 12:17:42,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:17:42,888 INFO L158 Benchmark]: Toolchain (without parser) took 5085.80ms. Allocated memory was 182.5MB in the beginning and 248.5MB in the end (delta: 66.1MB). Free memory was 125.5MB in the beginning and 135.2MB in the end (delta: -9.7MB). Peak memory consumption was 55.8MB. Max. memory is 8.0GB. [2022-04-15 12:17:42,889 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 182.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:17:42,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.38ms. Allocated memory was 182.5MB in the beginning and 248.5MB in the end (delta: 66.1MB). Free memory was 125.3MB in the beginning and 220.3MB in the end (delta: -95.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2022-04-15 12:17:42,889 INFO L158 Benchmark]: Boogie Preprocessor took 75.32ms. Allocated memory is still 248.5MB. Free memory was 220.3MB in the beginning and 218.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:17:42,891 INFO L158 Benchmark]: RCFGBuilder took 603.64ms. Allocated memory is still 248.5MB. Free memory was 218.9MB in the beginning and 207.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:17:42,891 INFO L158 Benchmark]: TraceAbstraction took 3957.93ms. Allocated memory is still 248.5MB. Free memory was 207.4MB in the beginning and 135.2MB in the end (delta: 72.2MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. [2022-04-15 12:17:42,893 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.14ms. Allocated memory is still 182.5MB. Free memory is still 141.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.38ms. Allocated memory was 182.5MB in the beginning and 248.5MB in the end (delta: 66.1MB). Free memory was 125.3MB in the beginning and 220.3MB in the end (delta: -95.1MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 75.32ms. Allocated memory is still 248.5MB. Free memory was 220.3MB in the beginning and 218.9MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 603.64ms. Allocated memory is still 248.5MB. Free memory was 218.9MB in the beginning and 207.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3957.93ms. Allocated memory is still 248.5MB. Free memory was 207.4MB in the beginning and 135.2MB in the end (delta: 72.2MB). Peak memory consumption was 72.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 81 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 24 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 32 PreInvPairs, 48 NumberOfFragments, 98 HoareAnnotationTreeSize, 32 FomulaSimplifications, 20 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 20 FomulaSimplificationsInter, 54 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: x == 1 && 0 < y % 4294967296 - ProcedureContractResult [Line: 17]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 12:17:42,944 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...