/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/nla-digbench/geo1-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:47:26,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:47:26,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:47:26,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:47:26,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:47:26,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:47:26,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:47:26,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:47:26,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:47:26,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:47:26,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:47:26,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:47:26,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:47:26,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:47:26,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:47:26,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:47:26,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:47:26,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:47:26,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:47:26,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:47:26,526 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:47:26,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:47:26,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:47:26,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:47:26,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:47:26,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:47:26,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:47:26,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:47:26,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:47:26,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:47:26,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:47:26,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:47:26,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:47:26,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:47:26,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:47:26,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:47:26,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:47:26,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:47:26,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:47:26,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:47:26,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:47:26,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:47:26,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:47:26,560 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:47:26,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:47:26,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:47:26,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:47:26,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:47:26,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:47:26,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:47:26,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:47:26,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:47:26,563 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:47:26,563 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:47:26,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:47:26,563 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:47:26,563 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-28 10:47:26,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:47:26,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:47:26,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:47:26,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:47:26,821 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:47:26,822 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo1-ll.c [2022-04-28 10:47:26,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eb3ffd4/b1f547ea7bdf4d54bcf0a2574d88ef90/FLAG265d40225 [2022-04-28 10:47:27,219 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:47:27,219 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo1-ll.c [2022-04-28 10:47:27,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eb3ffd4/b1f547ea7bdf4d54bcf0a2574d88ef90/FLAG265d40225 [2022-04-28 10:47:27,235 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61eb3ffd4/b1f547ea7bdf4d54bcf0a2574d88ef90 [2022-04-28 10:47:27,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:47:27,238 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:47:27,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:47:27,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:47:27,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:47:27,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@156e301c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27, skipping insertion in model container [2022-04-28 10:47:27,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:47:27,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:47:27,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo1-ll.c[546,559] [2022-04-28 10:47:27,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:47:27,388 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:47:27,396 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo1-ll.c[546,559] [2022-04-28 10:47:27,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:47:27,415 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:47:27,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27 WrapperNode [2022-04-28 10:47:27,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:47:27,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:47:27,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:47:27,416 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:47:27,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:47:27,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:47:27,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:47:27,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:47:27,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (1/1) ... [2022-04-28 10:47:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:47:27,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:27,509 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-28 10:47:27,529 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-28 10:47:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:47:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:47:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:47:27,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:47:27,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:47:27,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:47:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:47:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:47:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:47:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:47:27,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:47:27,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:47:27,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:47:27,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:47:27,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:47:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:47:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:47:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:47:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:47:27,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:47:27,591 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:47:27,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:47:27,771 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:47:27,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:47:27,786 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 10:47:27,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:47:27 BoogieIcfgContainer [2022-04-28 10:47:27,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:47:27,788 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:47:27,788 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:47:27,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:47:27,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:47:27" (1/3) ... [2022-04-28 10:47:27,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ce8230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:47:27, skipping insertion in model container [2022-04-28 10:47:27,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:27" (2/3) ... [2022-04-28 10:47:27,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ce8230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:47:27, skipping insertion in model container [2022-04-28 10:47:27,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:47:27" (3/3) ... [2022-04-28 10:47:27,811 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll.c [2022-04-28 10:47:27,821 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:47:27,821 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:47:27,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:47:27,895 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@485c676f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@160e6c18 [2022-04-28 10:47:27,895 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:47:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 10:47:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:47:27,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:27,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:27,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:27,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:27,928 INFO L85 PathProgramCache]: Analyzing trace with hash 269945389, now seen corresponding path program 1 times [2022-04-28 10:47:27,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:27,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [636598022] [2022-04-28 10:47:27,950 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash 269945389, now seen corresponding path program 2 times [2022-04-28 10:47:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:27,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960187337] [2022-04-28 10:47:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:28,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:47:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:28,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 10:47:28,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 10:47:28,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 10:47:28,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 10:47:28,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:28,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 10:47:28,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 10:47:28,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 10:47:28,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 10:47:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 10:47:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:28,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 10:47:28,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 10:47:28,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 10:47:28,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 10:47:28,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:47:28,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 10:47:28,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 10:47:28,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-28 10:47:28,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-28 10:47:28,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-28 10:47:28,168 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {32#true} is VALID [2022-04-28 10:47:28,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 10:47:28,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 10:47:28,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 10:47:28,169 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-28 10:47:28,169 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {32#true} is VALID [2022-04-28 10:47:28,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-28 10:47:28,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-28 10:47:28,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-28 10:47:28,170 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-28 10:47:28,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {33#false} is VALID [2022-04-28 10:47:28,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 10:47:28,170 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {33#false} is VALID [2022-04-28 10:47:28,170 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-28 10:47:28,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-28 10:47:28,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 10:47:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:28,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:28,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960187337] [2022-04-28 10:47:28,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960187337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:28,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:28,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:47:28,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:28,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [636598022] [2022-04-28 10:47:28,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [636598022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:28,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:28,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 10:47:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784672380] [2022-04-28 10:47:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 10:47:28,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:28,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:28,207 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-28 10:47:28,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 10:47:28,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:28,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 10:47:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 10:47:28,232 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:28,368 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-28 10:47:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 10:47:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 10:47:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 10:47:28,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-28 10:47:28,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-28 10:47:28,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:28,485 INFO L225 Difference]: With dead ends: 51 [2022-04-28 10:47:28,485 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 10:47:28,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-28 10:47:28,491 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:28,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:47:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 10:47:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 10:47:28,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:28,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:47:28,527 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:47:28,528 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:47:28,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:28,535 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 10:47:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:47:28,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:28,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:28,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-28 10:47:28,542 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-28 10:47:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:28,545 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 10:47:28,545 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:47:28,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:28,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:28,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:28,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 10:47:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 10:47:28,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2022-04-28 10:47:28,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:28,551 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 10:47:28,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:47:28,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 10:47:28,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 10:47:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:47:28,620 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:28,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:28,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:47:28,621 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash -61113491, now seen corresponding path program 1 times [2022-04-28 10:47:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:28,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842316800] [2022-04-28 10:47:28,622 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash -61113491, now seen corresponding path program 2 times [2022-04-28 10:47:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:28,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095359173] [2022-04-28 10:47:28,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:28,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:28,640 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:47:28,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982612882] [2022-04-28 10:47:28,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:47:28,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:28,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:28,642 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-28 10:47:28,662 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-28 10:47:28,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 10:47:28,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:47:28,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:47:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:28,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:47:28,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-28 10:47:28,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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(10, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-28 10:47:28,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 10:47:28,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #61#return; {246#true} is VALID [2022-04-28 10:47:28,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret6 := main(); {246#true} is VALID [2022-04-28 10:47:28,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {246#true} is VALID [2022-04-28 10:47:28,857 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {246#true} is VALID [2022-04-28 10:47:28,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 10:47:28,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 10:47:28,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 10:47:28,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-28 10:47:28,858 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {246#true} is VALID [2022-04-28 10:47:28,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-28 10:47:28,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-28 10:47:28,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-28 10:47:28,862 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-28 10:47:28,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {299#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 10:47:28,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} assume !false; {299#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 10:47:28,866 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~z~0 main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:28,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:28,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-28 10:47:28,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-28 10:47:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:28,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:47:28,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:28,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095359173] [2022-04-28 10:47:28,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:47:28,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982612882] [2022-04-28 10:47:28,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982612882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:28,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:28,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:47:28,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:28,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842316800] [2022-04-28 10:47:28,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842316800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:28,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:28,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:47:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582350044] [2022-04-28 10:47:28,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:28,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 10:47:28,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:28,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:47:28,890 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-28 10:47:28,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:47:28,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:28,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:47:28,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:47:28,892 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:47:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:29,002 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-28 10:47:29,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:47:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 10:47:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:47:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 10:47:29,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:47:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-28 10:47:29,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-28 10:47:29,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:29,038 INFO L225 Difference]: With dead ends: 34 [2022-04-28 10:47:29,038 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 10:47:29,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:47:29,040 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:29,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:47:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 10:47:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-28 10:47:29,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:29,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:47:29,056 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:47:29,056 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:47:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:29,061 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 10:47:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 10:47:29,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:29,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:29,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 10:47:29,065 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-04-28 10:47:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:29,067 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 10:47:29,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 10:47:29,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:29,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:29,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:29,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 10:47:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-28 10:47:29,077 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 22 [2022-04-28 10:47:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:29,078 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-28 10:47:29,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 10:47:29,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-28 10:47:29,108 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-28 10:47:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-28 10:47:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:47:29,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:47:29,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:47:29,134 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-28 10:47:29,333 WARN L477 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-28 10:47:29,334 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:47:29,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:47:29,334 INFO L85 PathProgramCache]: Analyzing trace with hash -990942717, now seen corresponding path program 1 times [2022-04-28 10:47:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:29,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1249996251] [2022-04-28 10:47:29,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:47:29,335 INFO L85 PathProgramCache]: Analyzing trace with hash -990942717, now seen corresponding path program 2 times [2022-04-28 10:47:29,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:47:29,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340126724] [2022-04-28 10:47:29,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:47:29,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:47:29,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:47:29,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [541052259] [2022-04-28 10:47:29,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:47:29,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:47:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:29,353 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:47:29,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 10:47:29,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:47:29,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:47:29,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 10:47:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:47:29,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:47:31,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {510#true} call ULTIMATE.init(); {510#true} is VALID [2022-04-28 10:47:31,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#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(10, 2);call #Ultimate.allocInit(12, 3); {510#true} is VALID [2022-04-28 10:47:31,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume true; {510#true} is VALID [2022-04-28 10:47:31,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {510#true} {510#true} #61#return; {510#true} is VALID [2022-04-28 10:47:31,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {510#true} call #t~ret6 := main(); {510#true} is VALID [2022-04-28 10:47:31,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {510#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {510#true} is VALID [2022-04-28 10:47:31,875 INFO L272 TraceCheckUtils]: 6: Hoare triple {510#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {510#true} is VALID [2022-04-28 10:47:31,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#true} ~cond := #in~cond; {510#true} is VALID [2022-04-28 10:47:31,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#true} assume !(0 == ~cond); {510#true} is VALID [2022-04-28 10:47:31,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#true} assume true; {510#true} is VALID [2022-04-28 10:47:31,876 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {510#true} {510#true} #53#return; {510#true} is VALID [2022-04-28 10:47:31,876 INFO L272 TraceCheckUtils]: 11: Hoare triple {510#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {510#true} is VALID [2022-04-28 10:47:31,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {510#true} ~cond := #in~cond; {510#true} is VALID [2022-04-28 10:47:31,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {510#true} assume !(0 == ~cond); {510#true} is VALID [2022-04-28 10:47:31,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {510#true} assume true; {510#true} is VALID [2022-04-28 10:47:31,876 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {510#true} {510#true} #55#return; {510#true} is VALID [2022-04-28 10:47:31,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {510#true} is VALID [2022-04-28 10:47:31,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {510#true} assume !false; {510#true} is VALID [2022-04-28 10:47:31,877 INFO L272 TraceCheckUtils]: 18: Hoare triple {510#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {510#true} is VALID [2022-04-28 10:47:31,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {510#true} ~cond := #in~cond; {572#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:31,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {572#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:31,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {576#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:31,879 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {576#(not (= |__VERIFIER_assert_#in~cond| 0))} {510#true} #57#return; {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 10:47:31,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 10:47:31,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {590#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} is VALID [2022-04-28 10:47:31,884 INFO L272 TraceCheckUtils]: 25: Hoare triple {590#(exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0)))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:31,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:31,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {511#false} is VALID [2022-04-28 10:47:31,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {511#false} assume !false; {511#false} is VALID [2022-04-28 10:47:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:31,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:47:32,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {511#false} assume !false; {511#false} is VALID [2022-04-28 10:47:32,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {511#false} is VALID [2022-04-28 10:47:32,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:47:32,254 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ main_~x~0 1) main_~y~0)} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:47:32,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} ~x~0 := ~x~0 * (~z~0 - 1); {614#(= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-28 10:47:32,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} assume !(~c~0 < ~k~0); {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 10:47:32,256 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {576#(not (= |__VERIFIER_assert_#in~cond| 0))} {510#true} #57#return; {583#(= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0))} is VALID [2022-04-28 10:47:32,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {576#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:32,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {633#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {576#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:47:32,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {510#true} ~cond := #in~cond; {633#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:47:32,257 INFO L272 TraceCheckUtils]: 18: Hoare triple {510#true} call __VERIFIER_assert((if 0 == 1 + (~x~0 * ~z~0 - ~x~0 - ~y~0) then 1 else 0)); {510#true} is VALID [2022-04-28 10:47:32,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {510#true} assume !false; {510#true} is VALID [2022-04-28 10:47:32,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#true} ~x~0 := 1;~y~0 := ~z~0;~c~0 := 1; {510#true} is VALID [2022-04-28 10:47:32,258 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {510#true} {510#true} #55#return; {510#true} is VALID [2022-04-28 10:47:32,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {510#true} assume true; {510#true} is VALID [2022-04-28 10:47:32,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {510#true} assume !(0 == ~cond); {510#true} is VALID [2022-04-28 10:47:32,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {510#true} ~cond := #in~cond; {510#true} is VALID [2022-04-28 10:47:32,260 INFO L272 TraceCheckUtils]: 11: Hoare triple {510#true} call assume_abort_if_not((if ~k~0 >= 1 then 1 else 0)); {510#true} is VALID [2022-04-28 10:47:32,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {510#true} {510#true} #53#return; {510#true} is VALID [2022-04-28 10:47:32,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {510#true} assume true; {510#true} is VALID [2022-04-28 10:47:32,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {510#true} assume !(0 == ~cond); {510#true} is VALID [2022-04-28 10:47:32,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {510#true} ~cond := #in~cond; {510#true} is VALID [2022-04-28 10:47:32,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {510#true} call assume_abort_if_not((if ~z~0 >= 1 then 1 else 0)); {510#true} is VALID [2022-04-28 10:47:32,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {510#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {510#true} is VALID [2022-04-28 10:47:32,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {510#true} call #t~ret6 := main(); {510#true} is VALID [2022-04-28 10:47:32,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {510#true} {510#true} #61#return; {510#true} is VALID [2022-04-28 10:47:32,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {510#true} assume true; {510#true} is VALID [2022-04-28 10:47:32,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {510#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(10, 2);call #Ultimate.allocInit(12, 3); {510#true} is VALID [2022-04-28 10:47:32,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {510#true} call ULTIMATE.init(); {510#true} is VALID [2022-04-28 10:47:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 10:47:32,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:47:32,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340126724] [2022-04-28 10:47:32,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:47:32,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541052259] [2022-04-28 10:47:32,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541052259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:47:32,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:47:32,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 10:47:32,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:47:32,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1249996251] [2022-04-28 10:47:32,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1249996251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:47:32,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:47:32,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:47:32,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340783947] [2022-04-28 10:47:32,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:47:32,266 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 10:47:32,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:47:32,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:47:32,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:32,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:47:32,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:47:32,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:47:32,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:47:32,307 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:47:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:32,474 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-28 10:47:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:47:32,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 10:47:32,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:47:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:47:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 10:47:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:47:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2022-04-28 10:47:32,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2022-04-28 10:47:32,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:47:32,513 INFO L225 Difference]: With dead ends: 30 [2022-04-28 10:47:32,513 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:47:32,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:47:32,514 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 9 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:47:32,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 94 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-04-28 10:47:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:47:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:47:32,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:47:32,515 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-28 10:47:32,515 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-28 10:47:32,515 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-28 10:47:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:32,515 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:47:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:47:32,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:32,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:32,515 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-28 10:47:32,515 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-28 10:47:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:47:32,516 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:47:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:47:32,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:32,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:47:32,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:47:32,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:47:32,516 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-28 10:47:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:47:32,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-04-28 10:47:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:47:32,516 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:47:32,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 10:47:32,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:47:32,516 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-28 10:47:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:47:32,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:47:32,519 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:47:32,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 10:47:32,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 10:47:32,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:47:32,811 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-28 10:47:32,811 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-28 10:47:32,812 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L895 garLoopResultBuilder]: At program point L34-2(lines 34 44) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-28 10:47:32,812 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 44) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 50) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: true [2022-04-28 10:47:32,812 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 50) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L895 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (exists ((v_main_~x~0_11 Int) (main_~z~0 Int)) (and (= (+ (* v_main_~x~0_11 main_~z~0) 1) (+ v_main_~x~0_11 main_~y~0)) (= main_~x~0 (* v_main_~x~0_11 (+ (- 1) main_~z~0))))) [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point L48-1(line 48) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 50) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-28 10:47:32,813 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 44) the Hoare annotation is: (= (+ (* main_~z~0 main_~x~0) 1) (+ main_~y~0 main_~x~0)) [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L895 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-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:47:32,813 INFO L895 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:47:32,813 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:47:32,814 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-28 10:47:32,814 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:47:32,814 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:47:32,814 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:47:32,816 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-28 10:47:32,818 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:47:32,820 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:47:32,822 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:47:32,854 INFO L163 areAnnotationChecker]: CFG has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:47:32,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:47:32 BoogieIcfgContainer [2022-04-28 10:47:32,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:47:32,862 INFO L158 Benchmark]: Toolchain (without parser) took 5624.39ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 143.1MB in the beginning and 92.2MB in the end (delta: 50.8MB). Peak memory consumption was 89.3MB. Max. memory is 8.0GB. [2022-04-28 10:47:32,863 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 194.0MB. Free memory was 159.5MB in the beginning and 159.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:47:32,863 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.54ms. Allocated memory is still 194.0MB. Free memory was 142.9MB in the beginning and 169.1MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:47:32,863 INFO L158 Benchmark]: Boogie Preprocessor took 34.73ms. Allocated memory is still 194.0MB. Free memory was 169.1MB in the beginning and 167.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 10:47:32,863 INFO L158 Benchmark]: RCFGBuilder took 335.61ms. Allocated memory is still 194.0MB. Free memory was 167.7MB in the beginning and 156.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:47:32,864 INFO L158 Benchmark]: TraceAbstraction took 5073.26ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 156.2MB in the beginning and 92.2MB in the end (delta: 64.0MB). Peak memory consumption was 103.0MB. Max. memory is 8.0GB. [2022-04-28 10:47:32,865 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 194.0MB. Free memory was 159.5MB in the beginning and 159.4MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.54ms. Allocated memory is still 194.0MB. Free memory was 142.9MB in the beginning and 169.1MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.73ms. Allocated memory is still 194.0MB. Free memory was 169.1MB in the beginning and 167.7MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.61ms. Allocated memory is still 194.0MB. Free memory was 167.7MB in the beginning and 156.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5073.26ms. Allocated memory was 194.0MB in the beginning and 232.8MB in the end (delta: 38.8MB). Free memory was 156.2MB in the beginning and 92.2MB in the end (delta: 64.0MB). Peak memory consumption was 103.0MB. 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: 18]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 68 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 61 PreInvPairs, 87 NumberOfFragments, 111 HoareAnnotationTreeSize, 61 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 94 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: 34]: Loop Invariant Derived loop invariant: z * x + 1 == y + x - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:47:32,884 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...