/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:09:49,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:09:49,496 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:09:49,527 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:09:49,527 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:09:49,528 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:09:49,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:09:49,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:09:49,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:09:49,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:09:49,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:09:49,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:09:49,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:09:49,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:09:49,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:09:49,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:09:49,543 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:09:49,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:09:49,545 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:09:49,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:09:49,551 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:09:49,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:09:49,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:09:49,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:09:49,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:09:49,554 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:09:49,554 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:09:49,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:09:49,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:09:49,555 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:09:49,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:09:49,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:09:49,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:09:49,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:09:49,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:09:49,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:09:49,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:09:49,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:09:49,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:09:49,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:09:49,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:09:49,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:09:49,563 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 09:09:49,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:09:49,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:09:49,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:09:49,572 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:09:49,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:09:49,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:09:49,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:09:49,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:09:49,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:09:49,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:09:49,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:09:49,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:09:49,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:09:49,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:09:49,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:09:49,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:09:49,574 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 09:09:49,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:09:49,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:09:49,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:09:49,738 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:09:49,739 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:09:49,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c [2022-04-15 09:09:49,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280ee3f00/8491e3352fcb404cab3f737591a2d428/FLAGcc9665bf9 [2022-04-15 09:09:50,136 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:09:50,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_valuebound2.c [2022-04-15 09:09:50,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280ee3f00/8491e3352fcb404cab3f737591a2d428/FLAGcc9665bf9 [2022-04-15 09:09:50,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/280ee3f00/8491e3352fcb404cab3f737591a2d428 [2022-04-15 09:09:50,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:09:50,153 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:09:50,155 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:09:50,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:09:50,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:09:50,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c240b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50, skipping insertion in model container [2022-04-15 09:09:50,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:09:50,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:09:50,285 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-scaling/geo2-ll_valuebound2.c[525,538] [2022-04-15 09:09:50,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:09:50,300 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:09:50,324 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-scaling/geo2-ll_valuebound2.c[525,538] [2022-04-15 09:09:50,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:09:50,338 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:09:50,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50 WrapperNode [2022-04-15 09:09:50,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:09:50,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:09:50,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:09:50,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:09:50,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:09:50,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:09:50,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:09:50,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:09:50,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (1/1) ... [2022-04-15 09:09:50,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:09:50,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:50,394 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 09:09:50,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 09:09:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:09:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:09:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:09:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:09:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:09:50,419 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:09:50,419 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:09:50,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:09:50,457 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:09:50,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:09:50,618 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:09:50,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:09:50,623 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 09:09:50,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:09:50 BoogieIcfgContainer [2022-04-15 09:09:50,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:09:50,626 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:09:50,626 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:09:50,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:09:50,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:09:50" (1/3) ... [2022-04-15 09:09:50,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea5bd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:09:50, skipping insertion in model container [2022-04-15 09:09:50,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:09:50" (2/3) ... [2022-04-15 09:09:50,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea5bd7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:09:50, skipping insertion in model container [2022-04-15 09:09:50,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:09:50" (3/3) ... [2022-04-15 09:09:50,630 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound2.c [2022-04-15 09:09:50,633 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:09:50,633 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:09:50,660 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:09:50,665 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 09:09:50,665 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:09:50,675 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-15 09:09:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 09:09:50,680 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:50,680 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:09:50,681 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1276201559, now seen corresponding path program 1 times [2022-04-15 09:09:50,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:50,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1503411815] [2022-04-15 09:09:50,696 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1276201559, now seen corresponding path program 2 times [2022-04-15 09:09:50,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:50,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875036928] [2022-04-15 09:09:50,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:50,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:50,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:50,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:09:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:50,878 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-15 09:09:50,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 09:09:50,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-15 09:09:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:09:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:50,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 09:09:50,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 09:09:50,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 09:09:50,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 09:09:50,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 09:09:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:50,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 09:09:50,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 09:09:50,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 09:09:50,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 09:09:50,912 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-15 09:09:50,913 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-15 09:09:50,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 09:09:50,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #61#return; {32#true} is VALID [2022-04-15 09:09:50,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-15 09:09:50,914 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; {32#true} is VALID [2022-04-15 09:09:50,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {32#true} is VALID [2022-04-15 09:09:50,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 09:09:50,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 09:09:50,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 09:09:50,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-15 09:09:50,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {33#false} is VALID [2022-04-15 09:09:50,917 INFO L272 TraceCheckUtils]: 12: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {32#true} is VALID [2022-04-15 09:09:50,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 09:09:50,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 09:09:50,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 09:09:50,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-15 09:09:50,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {33#false} is VALID [2022-04-15 09:09:50,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-15 09:09:50,919 INFO L272 TraceCheckUtils]: 19: Hoare triple {33#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {33#false} is VALID [2022-04-15 09:09:50,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 09:09:50,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 09:09:50,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 09:09:50,920 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-15 09:09:50,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:50,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875036928] [2022-04-15 09:09:50,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875036928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:50,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:50,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:09:50,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:50,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1503411815] [2022-04-15 09:09:50,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1503411815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:50,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:50,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:09:50,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467940501] [2022-04-15 09:09:50,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:50,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 23 [2022-04-15 09:09:50,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:50,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 09:09:50,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:50,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 09:09:50,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:50,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 09:09:50,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:09:50,981 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 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 09:09:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:51,091 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2022-04-15 09:09:51,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 09:09:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 23 [2022-04-15 09:09:51,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 09:09:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 09:09:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 09:09:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 09:09:51,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 09:09:51,185 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-15 09:09:51,191 INFO L225 Difference]: With dead ends: 51 [2022-04-15 09:09:51,192 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 09:09:51,194 INFO L912 BasicCegarLoop]: 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-15 09:09:51,196 INFO L913 BasicCegarLoop]: 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-15 09:09:51,197 INFO L914 BasicCegarLoop]: 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-15 09:09:51,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 09:09:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 09:09:51,232 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:51,235 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-15 09:09:51,235 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-15 09:09:51,239 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-15 09:09:51,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:51,244 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 09:09:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 09:09:51,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:51,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:51,245 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-15 09:09:51,246 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-15 09:09:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:51,247 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 09:09:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 09:09:51,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:51,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:51,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:51,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:51,248 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-15 09:09:51,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 09:09:51,251 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2022-04-15 09:09:51,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:51,251 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 09:09:51,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-15 09:09:51,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 09:09:51,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:51,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 09:09:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 09:09:51,274 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:51,275 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:09:51,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 09:09:51,275 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:51,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:51,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1874219407, now seen corresponding path program 1 times [2022-04-15 09:09:51,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:51,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039975251] [2022-04-15 09:09:51,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:51,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1874219407, now seen corresponding path program 2 times [2022-04-15 09:09:51,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:51,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446698053] [2022-04-15 09:09:51,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:51,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:51,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:09:51,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348913411] [2022-04-15 09:09:51,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:09:51,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:51,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:51,313 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:09:51,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 09:09:51,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:09:51,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:09:51,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:09:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:51,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:09:51,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-15 09:09:51,516 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-15 09:09:51,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 09:09:51,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #61#return; {246#true} is VALID [2022-04-15 09:09:51,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret6 := main(); {246#true} is VALID [2022-04-15 09:09:51,517 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; {246#true} is VALID [2022-04-15 09:09:51,517 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {246#true} is VALID [2022-04-15 09:09:51,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 09:09:51,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 09:09:51,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 09:09:51,518 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-15 09:09:51,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {246#true} is VALID [2022-04-15 09:09:51,518 INFO L272 TraceCheckUtils]: 12: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {246#true} is VALID [2022-04-15 09:09:51,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-15 09:09:51,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-15 09:09:51,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-15 09:09:51,518 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-15 09:09:51,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {246#true} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {302#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 09:09:51,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {302#(and (= main_~y~0 1) (= main_~x~0 1))} assume !false; {302#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-15 09:09:51,520 INFO L272 TraceCheckUtils]: 19: Hoare triple {302#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {309#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:09:51,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {309#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {313#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:51,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-15 09:09:51,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-15 09:09:51,521 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-15 09:09:51,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:09:51,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:09:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446698053] [2022-04-15 09:09:51,522 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:09:51,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348913411] [2022-04-15 09:09:51,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348913411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:51,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:51,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:09:51,523 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:09:51,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039975251] [2022-04-15 09:09:51,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039975251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:09:51,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:09:51,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:09:51,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570674082] [2022-04-15 09:09:51,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:09:51,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 23 [2022-04-15 09:09:51,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:09:51,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-15 09:09:51,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:51,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:09:51,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:09:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:09:51,538 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-15 09:09:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:51,635 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-15 09:09:51,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:09:51,635 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 23 [2022-04-15 09:09:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:09:51,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-15 09:09:51,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 09:09:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-15 09:09:51,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 09:09:51,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-15 09:09:51,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:51,676 INFO L225 Difference]: With dead ends: 34 [2022-04-15 09:09:51,676 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 09:09:51,678 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-15 09:09:51,679 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:09:51,682 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:09:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 09:09:51,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 09:09:51,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:09:51,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 09:09:51,694 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 09:09:51,695 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 09:09:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:51,700 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 09:09:51,700 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 09:09:51,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:51,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:51,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-15 09:09:51,707 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 31 states. [2022-04-15 09:09:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:09:51,710 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 09:09:51,710 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 09:09:51,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:09:51,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:09:51,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:09:51,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:09:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 09:09:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 09:09:51,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-15 09:09:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:09:51,725 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 09:09:51,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-15 09:09:51,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 09:09:51,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:09:51,758 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 09:09:51,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 09:09:51,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:09:51,759 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:09:51,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 09:09:51,977 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:51,977 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:09:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:09:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash 156588053, now seen corresponding path program 1 times [2022-04-15 09:09:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:09:51,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [950324621] [2022-04-15 09:09:51,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:09:51,979 INFO L85 PathProgramCache]: Analyzing trace with hash 156588053, now seen corresponding path program 2 times [2022-04-15 09:09:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:09:51,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374662751] [2022-04-15 09:09:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:09:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:09:51,996 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:09:51,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784340910] [2022-04-15 09:09:51,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:09:51,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:09:51,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:09:51,997 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-15 09:09:51,998 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-15 09:09:52,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:09:52,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:09:52,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 09:09:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:09:52,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:09:52,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {513#true} call ULTIMATE.init(); {513#true} is VALID [2022-04-15 09:09:52,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#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); {513#true} is VALID [2022-04-15 09:09:52,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-15 09:09:52,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {513#true} {513#true} #61#return; {513#true} is VALID [2022-04-15 09:09:52,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call #t~ret6 := main(); {513#true} is VALID [2022-04-15 09:09:52,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#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; {513#true} is VALID [2022-04-15 09:09:52,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {513#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {513#true} is VALID [2022-04-15 09:09:52,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} ~cond := #in~cond; {539#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:09:52,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {543#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:09:52,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {543#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:09:52,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {543#(not (= |assume_abort_if_not_#in~cond| 0))} {513#true} #53#return; {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-15 09:09:52,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-15 09:09:52,434 INFO L272 TraceCheckUtils]: 12: Hoare triple {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {513#true} is VALID [2022-04-15 09:09:52,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-15 09:09:52,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-15 09:09:52,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-15 09:09:52,435 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {513#true} {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} #55#return; {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-15 09:09:52,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {550#(and (<= main_~z~0 2) (<= 0 main_~z~0))} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-15 09:09:52,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} assume !false; {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-15 09:09:52,439 INFO L272 TraceCheckUtils]: 19: Hoare triple {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {513#true} is VALID [2022-04-15 09:09:52,440 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#true} ~cond := #in~cond; {582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:52,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {582#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:09:52,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:09:52,442 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {586#(not (= |__VERIFIER_assert_#in~cond| 0))} {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} #57#return; {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} is VALID [2022-04-15 09:09:52,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {572#(and (= main_~y~0 1) (= main_~x~0 1) (<= main_~z~0 2) (<= 0 main_~z~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {596#(and (= main_~z~0 main_~y~0) (<= main_~z~0 2) (<= 0 main_~z~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-15 09:09:52,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {596#(and (= main_~z~0 main_~y~0) (<= main_~z~0 2) (<= 0 main_~z~0) (= main_~x~0 (+ main_~z~0 1)))} assume !false; {596#(and (= main_~z~0 main_~y~0) (<= main_~z~0 2) (<= 0 main_~z~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-15 09:09:52,444 INFO L272 TraceCheckUtils]: 26: Hoare triple {596#(and (= main_~z~0 main_~y~0) (<= main_~z~0 2) (<= 0 main_~z~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:09:52,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:09:52,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {514#false} is VALID [2022-04-15 09:09:52,446 INFO L290 TraceCheckUtils]: 29: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-04-15 09:09:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 09:09:52,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:10:04,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {514#false} assume !false; {514#false} is VALID [2022-04-15 09:10:04,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {607#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {514#false} is VALID [2022-04-15 09:10:04,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {603#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {607#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:04,424 INFO L272 TraceCheckUtils]: 26: Hoare triple {623#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {603#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:10:04,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !false; {623#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-15 09:10:04,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {630#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {623#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-15 09:10:04,429 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {586#(not (= |__VERIFIER_assert_#in~cond| 0))} {513#true} #57#return; {630#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-15 09:10:04,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {586#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:04,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {643#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {586#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:04,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#true} ~cond := #in~cond; {643#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:10:04,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {513#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {513#true} is VALID [2022-04-15 09:10:04,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#true} assume !false; {513#true} is VALID [2022-04-15 09:10:04,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#true} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {513#true} is VALID [2022-04-15 09:10:04,431 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {513#true} {513#true} #55#return; {513#true} is VALID [2022-04-15 09:10:04,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-15 09:10:04,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-15 09:10:04,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-15 09:10:04,433 INFO L272 TraceCheckUtils]: 12: Hoare triple {513#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {513#true} is VALID [2022-04-15 09:10:04,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {513#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {513#true} is VALID [2022-04-15 09:10:04,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {513#true} {513#true} #53#return; {513#true} is VALID [2022-04-15 09:10:04,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-15 09:10:04,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {513#true} assume !(0 == ~cond); {513#true} is VALID [2022-04-15 09:10:04,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {513#true} ~cond := #in~cond; {513#true} is VALID [2022-04-15 09:10:04,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {513#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {513#true} is VALID [2022-04-15 09:10:04,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {513#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; {513#true} is VALID [2022-04-15 09:10:04,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {513#true} call #t~ret6 := main(); {513#true} is VALID [2022-04-15 09:10:04,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {513#true} {513#true} #61#return; {513#true} is VALID [2022-04-15 09:10:04,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {513#true} assume true; {513#true} is VALID [2022-04-15 09:10:04,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#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); {513#true} is VALID [2022-04-15 09:10:04,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {513#true} call ULTIMATE.init(); {513#true} is VALID [2022-04-15 09:10:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:10:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:04,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374662751] [2022-04-15 09:10:04,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784340910] [2022-04-15 09:10:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784340910] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:10:04,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:10:04,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-04-15 09:10:04,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [950324621] [2022-04-15 09:10:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [950324621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:04,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:04,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:10:04,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964099323] [2022-04-15 09:10:04,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-15 09:10:04,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:04,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 09:10:04,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:04,472 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:10:04,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:04,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:10:04,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:10:04,473 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 09:10:04,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:04,818 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 09:10:04,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:10:04,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 30 [2022-04-15 09:10:04,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 09:10:04,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-15 09:10:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 09:10:04,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 41 transitions. [2022-04-15 09:10:04,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 41 transitions. [2022-04-15 09:10:04,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:04,856 INFO L225 Difference]: With dead ends: 41 [2022-04-15 09:10:04,856 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 09:10:04,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-15 09:10:04,857 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:04,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 121 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:10:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 09:10:04,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 09:10:04,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:04,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:10:04,878 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:10:04,878 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:10:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:04,880 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 09:10:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 09:10:04,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:04,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:04,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-15 09:10:04,881 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 38 states. [2022-04-15 09:10:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:04,882 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 09:10:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 09:10:04,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:04,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:04,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:04,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 09:10:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 09:10:04,884 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 30 [2022-04-15 09:10:04,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:04,884 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 09:10:04,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 09:10:04,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 09:10:04,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 09:10:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 09:10:04,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:04,923 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:04,939 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-15 09:10:05,131 WARN L460 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-15 09:10:05,132 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1865789967, now seen corresponding path program 3 times [2022-04-15 09:10:05,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:05,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1089844732] [2022-04-15 09:10:05,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:10:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1865789967, now seen corresponding path program 4 times [2022-04-15 09:10:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:05,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897220623] [2022-04-15 09:10:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:05,155 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:05,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998209295] [2022-04-15 09:10:05,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:10:05,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:05,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:05,157 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:10:05,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 09:10:05,194 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:10:05,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:05,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 09:10:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:05,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:05,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {946#true} call ULTIMATE.init(); {946#true} is VALID [2022-04-15 09:10:05,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {946#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); {946#true} is VALID [2022-04-15 09:10:05,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-15 09:10:05,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {946#true} {946#true} #61#return; {946#true} is VALID [2022-04-15 09:10:05,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {946#true} call #t~ret6 := main(); {946#true} is VALID [2022-04-15 09:10:05,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {946#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; {946#true} is VALID [2022-04-15 09:10:05,397 INFO L272 TraceCheckUtils]: 6: Hoare triple {946#true} call assume_abort_if_not((if ~z~0 >= 0 && ~z~0 <= 2 then 1 else 0)); {946#true} is VALID [2022-04-15 09:10:05,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-15 09:10:05,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-15 09:10:05,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-15 09:10:05,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {946#true} {946#true} #53#return; {946#true} is VALID [2022-04-15 09:10:05,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {946#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5; {946#true} is VALID [2022-04-15 09:10:05,397 INFO L272 TraceCheckUtils]: 12: Hoare triple {946#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 2 then 1 else 0)); {946#true} is VALID [2022-04-15 09:10:05,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {946#true} ~cond := #in~cond; {990#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:10:05,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {990#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {994#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:10:05,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {994#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:10:05,399 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {994#(not (= |assume_abort_if_not_#in~cond| 0))} {946#true} #55#return; {1001#(and (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 09:10:05,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {1001#(and (<= 0 main_~k~0) (<= main_~k~0 2))} ~x~0 := 1;~y~0 := 1;~c~0 := 1; {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 09:10:05,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} assume !false; {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 09:10:05,400 INFO L272 TraceCheckUtils]: 19: Hoare triple {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {946#true} is VALID [2022-04-15 09:10:05,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-15 09:10:05,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-15 09:10:05,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-15 09:10:05,401 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {946#true} {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} #57#return; {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-15 09:10:05,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {1005#(and (<= 1 main_~c~0) (<= 0 main_~k~0) (<= main_~k~0 2))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-15 09:10:05,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} assume !false; {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-15 09:10:05,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {946#true} is VALID [2022-04-15 09:10:05,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {946#true} ~cond := #in~cond; {946#true} is VALID [2022-04-15 09:10:05,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {946#true} assume !(0 == ~cond); {946#true} is VALID [2022-04-15 09:10:05,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {946#true} assume true; {946#true} is VALID [2022-04-15 09:10:05,403 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {946#true} {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} #57#return; {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} is VALID [2022-04-15 09:10:05,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {1027#(and (<= 0 main_~k~0) (<= main_~k~0 2) (<= 2 main_~c~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {947#false} is VALID [2022-04-15 09:10:05,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {947#false} assume !false; {947#false} is VALID [2022-04-15 09:10:05,404 INFO L272 TraceCheckUtils]: 33: Hoare triple {947#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {947#false} is VALID [2022-04-15 09:10:05,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {947#false} ~cond := #in~cond; {947#false} is VALID [2022-04-15 09:10:05,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {947#false} assume 0 == ~cond; {947#false} is VALID [2022-04-15 09:10:05,404 INFO L290 TraceCheckUtils]: 36: Hoare triple {947#false} assume !false; {947#false} is VALID [2022-04-15 09:10:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 09:10:05,405 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:10:05,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897220623] [2022-04-15 09:10:05,405 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998209295] [2022-04-15 09:10:05,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998209295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:05,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:05,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:10:05,405 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:05,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1089844732] [2022-04-15 09:10:05,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1089844732] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:05,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:05,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:10:05,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378766469] [2022-04-15 09:10:05,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:05,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-15 09:10:05,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:05,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:10:05,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:05,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:10:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:05,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:10:05,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 09:10:05,432 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:10:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:05,567 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 09:10:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 09:10:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-15 09:10:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:10:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-15 09:10:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:10:05,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2022-04-15 09:10:05,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2022-04-15 09:10:05,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:05,593 INFO L225 Difference]: With dead ends: 38 [2022-04-15 09:10:05,593 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 09:10:05,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:10:05,594 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:05,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:10:05,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 09:10:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 09:10:05,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:05,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:10:05,595 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:10:05,595 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:10:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:05,595 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 09:10:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:10:05,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:05,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:05,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 09:10:05,596 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 09:10:05,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:05,596 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 09:10:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:10:05,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:05,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:05,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:05,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:05,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 09:10:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 09:10:05,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-04-15 09:10:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:05,596 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 09:10:05,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:10:05,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 09:10:05,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:05,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:10:05,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:05,599 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 09:10:05,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 09:10:05,809 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:05,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 09:10:05,968 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-15 09:10:05,968 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-15 09:10:05,968 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-15 09:10:05,968 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-04-15 09:10:05,968 INFO L878 garLoopResultBuilder]: At program point L12(line 12) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-04-15 09:10:05,968 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 09:10:05,968 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 11 13) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 44) the Hoare annotation is: (let ((.cse0 (<= 0 main_~k~0)) (.cse1 (<= main_~k~0 2)) (.cse2 (<= main_~z~0 2)) (.cse3 (<= 0 main_~z~0))) (or (and (= main_~z~0 main_~y~0) .cse0 .cse1 .cse2 .cse3 (<= 2 main_~c~0) (= main_~x~0 (+ main_~z~0 1))) (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) .cse1 (= main_~x~0 1) .cse2 .cse3))) [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L35-3(lines 35 44) the Hoare annotation is: (or (and (= main_~z~0 main_~y~0) (<= main_~z~0 2) (<= 0 main_~z~0) (= main_~x~0 (+ main_~z~0 1))) (and (= main_~y~0 1) (= main_~x~0 1))) [2022-04-15 09:10:05,969 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 23 47) the Hoare annotation is: true [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= main_~z~0 2) (<= 0 main_~z~0)) [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 0 main_~k~0) (<= main_~k~0 2) (<= main_~z~0 2) (<= 0 main_~z~0)) [2022-04-15 09:10:05,969 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~z~0 2) (<= 0 main_~z~0)) [2022-04-15 09:10:05,969 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 23 47) the Hoare annotation is: true [2022-04-15 09:10:05,969 INFO L885 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: true [2022-04-15 09:10:05,969 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 23 47) the Hoare annotation is: true [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse0 (<= 0 main_~k~0)) (.cse1 (<= main_~k~0 2)) (.cse2 (<= main_~z~0 2)) (.cse3 (<= 0 main_~z~0))) (or (and (= main_~z~0 main_~y~0) .cse0 .cse1 .cse2 .cse3 (<= 2 main_~c~0) (= main_~x~0 (+ main_~z~0 1))) (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) .cse1 (= main_~x~0 1) .cse2 .cse3))) [2022-04-15 09:10:05,969 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 35 44) the Hoare annotation is: (let ((.cse0 (<= 0 main_~k~0)) (.cse1 (<= main_~k~0 2)) (.cse2 (<= main_~z~0 2)) (.cse3 (<= 0 main_~z~0))) (or (and (= main_~z~0 main_~y~0) .cse0 .cse1 .cse2 .cse3 (<= 2 main_~c~0) (= main_~x~0 (+ main_~z~0 1))) (and (<= 1 main_~c~0) .cse0 (= main_~y~0 1) .cse1 (= main_~x~0 1) .cse2 .cse3))) [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 09:10:05,970 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:10:05,970 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 09:10:05,970 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:10:05,970 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:10:05,970 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 09:10:05,972 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-15 09:10:05,973 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 09:10:05,975 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 09:10:05,976 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 09:10:06,015 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-15 09:10:06,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 09:10:06 BoogieIcfgContainer [2022-04-15 09:10:06,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 09:10:06,024 INFO L158 Benchmark]: Toolchain (without parser) took 15871.03ms. Allocated memory was 198.2MB in the beginning and 239.1MB in the end (delta: 40.9MB). Free memory was 147.2MB in the beginning and 216.4MB in the end (delta: -69.2MB). Peak memory consumption was 109.2MB. Max. memory is 8.0GB. [2022-04-15 09:10:06,025 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 198.2MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 09:10:06,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.31ms. Allocated memory is still 198.2MB. Free memory was 147.0MB in the beginning and 173.4MB in the end (delta: -26.4MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. [2022-04-15 09:10:06,025 INFO L158 Benchmark]: Boogie Preprocessor took 28.44ms. Allocated memory is still 198.2MB. Free memory was 173.4MB in the beginning and 171.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 09:10:06,025 INFO L158 Benchmark]: RCFGBuilder took 256.95ms. Allocated memory is still 198.2MB. Free memory was 171.9MB in the beginning and 161.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 09:10:06,025 INFO L158 Benchmark]: TraceAbstraction took 15398.02ms. Allocated memory was 198.2MB in the beginning and 239.1MB in the end (delta: 40.9MB). Free memory was 160.8MB in the beginning and 216.4MB in the end (delta: -55.6MB). Peak memory consumption was 122.4MB. Max. memory is 8.0GB. [2022-04-15 09:10:06,026 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.08ms. Allocated memory is still 198.2MB. Free memory is still 163.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.31ms. Allocated memory is still 198.2MB. Free memory was 147.0MB in the beginning and 173.4MB in the end (delta: -26.4MB). Peak memory consumption was 13.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.44ms. Allocated memory is still 198.2MB. Free memory was 173.4MB in the beginning and 171.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 256.95ms. Allocated memory is still 198.2MB. Free memory was 171.9MB in the beginning and 161.5MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15398.02ms. Allocated memory was 198.2MB in the beginning and 239.1MB in the end (delta: 40.9MB). Free memory was 160.8MB in the beginning and 216.4MB in the end (delta: -55.6MB). Peak memory consumption was 122.4MB. 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: 17]: 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: 15.3s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 330 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 239 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 91 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=3, InterpolantAutomatonStates: 26, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 79 PreInvPairs, 115 NumberOfFragments, 262 HoareAnnotationTreeSize, 79 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 72 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: 35]: Loop Invariant Derived loop invariant: ((((((z == y && 0 <= k) && k <= 2) && z <= 2) && 0 <= z) && 2 <= c) && x == z + 1) || ((((((1 <= c && 0 <= k) && y == 1) && k <= 2) && x == 1) && z <= 2) && 0 <= z) - ProcedureContractResult [Line: 11]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: 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-15 09:10:06,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...