/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/sqrt1-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:01:45,188 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:01:45,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:01:45,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:01:45,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:01:45,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:01:45,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:01:45,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:01:45,242 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:01:45,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:01:45,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:01:45,246 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:01:45,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:01:45,247 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:01:45,248 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:01:45,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:01:45,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:01:45,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:01:45,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:01:45,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:01:45,252 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:01:45,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:01:45,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:01:45,253 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:01:45,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:01:45,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:01:45,259 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:01:45,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:01:45,260 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:01:45,260 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:01:45,261 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:01:45,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:01:45,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:01:45,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:01:45,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:01:45,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:01:45,263 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:01:45,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:01:45,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:01:45,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:01:45,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:01:45,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:01:45,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:01:45,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:01:45,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:01:45,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:01:45,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:01:45,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:01:45,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:01:45,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:01:45,277 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:01:45,277 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:01:45,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:01:45,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:01:45,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:01:45,278 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:01:45,278 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:01:45,278 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:01:45,278 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:01:45,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:01:45,279 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:01:45,279 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-08 08:01:45,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:01:45,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:01:45,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:01:45,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:01:45,548 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:01:45,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-04-08 08:01:45,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfeec6491/b325fe62e8b341cabb4bfa9afb25085c/FLAGd23bce623 [2022-04-08 08:01:45,978 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:01:45,978 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound1.c [2022-04-08 08:01:45,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfeec6491/b325fe62e8b341cabb4bfa9afb25085c/FLAGd23bce623 [2022-04-08 08:01:45,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfeec6491/b325fe62e8b341cabb4bfa9afb25085c [2022-04-08 08:01:45,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:01:45,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:01:46,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:01:46,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:01:46,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:01:46,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:01:45" (1/1) ... [2022-04-08 08:01:46,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e2f810f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46, skipping insertion in model container [2022-04-08 08:01:46,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:01:45" (1/1) ... [2022-04-08 08:01:46,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:01:46,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:01:46,156 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/sqrt1-ll_unwindbound1.c[520,533] [2022-04-08 08:01:46,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:01:46,184 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:01:46,192 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/sqrt1-ll_unwindbound1.c[520,533] [2022-04-08 08:01:46,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:01:46,215 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:01:46,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46 WrapperNode [2022-04-08 08:01:46,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:01:46,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:01:46,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:01:46,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:01:46,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,230 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,244 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:01:46,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:01:46,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:01:46,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:01:46,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (1/1) ... [2022-04-08 08:01:46,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:01:46,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:46,278 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-08 08:01:46,302 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-08 08:01:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:01:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:01:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:01:46,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 08:01:46,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 08:01:46,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:01:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:01:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:01:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:01:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:01:46,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:01:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 08:01:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 08:01:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:01:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:01:46,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:01:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:01:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:01:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:01:46,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:01:46,357 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:01:46,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:01:46,471 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:01:46,475 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:01:46,476 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:01:46,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:01:46 BoogieIcfgContainer [2022-04-08 08:01:46,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:01:46,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:01:46,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:01:46,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:01:46,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:01:45" (1/3) ... [2022-04-08 08:01:46,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2186c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:01:46, skipping insertion in model container [2022-04-08 08:01:46,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:01:46" (2/3) ... [2022-04-08 08:01:46,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e2186c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:01:46, skipping insertion in model container [2022-04-08 08:01:46,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:01:46" (3/3) ... [2022-04-08 08:01:46,482 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound1.c [2022-04-08 08:01:46,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:01:46,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:01:46,517 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:01:46,521 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-08 08:01:46,521 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:01:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 08:01:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 08:01:46,537 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:46,537 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:46,537 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:46,541 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-08 08:01:46,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:46,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519300040] [2022-04-08 08:01:46,557 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:01:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-08 08:01:46,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:46,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914366159] [2022-04-08 08:01:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:01:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:46,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-08 08:01:46,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 08:01:46,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 08:01:46,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:01:46,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-04-08 08:01:46,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-08 08:01:46,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-08 08:01:46,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-08 08:01:46,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {29#true} is VALID [2022-04-08 08:01:46,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-08 08:01:46,738 INFO L272 TraceCheckUtils]: 7: Hoare triple {30#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {30#false} is VALID [2022-04-08 08:01:46,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-08 08:01:46,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-08 08:01:46,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-08 08:01:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:01:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:46,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914366159] [2022-04-08 08:01:46,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914366159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:46,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:46,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:01:46,742 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:46,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519300040] [2022-04-08 08:01:46,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519300040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:46,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:46,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 08:01:46,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48400791] [2022-04-08 08:01:46,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:46,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 08:01:46,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:46,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:46,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:46,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 08:01:46,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:46,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 08:01:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:01:46,780 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:46,918 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-08 08:01:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 08:01:46,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 08:01:46,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:46,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 08:01:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-08 08:01:46,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-08 08:01:47,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,025 INFO L225 Difference]: With dead ends: 47 [2022-04-08 08:01:47,025 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 08:01:47,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 08:01:47,034 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:47,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:01:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 08:01:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 08:01:47,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:47,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,085 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,086 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,095 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 08:01:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 08:01:47,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:47,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:47,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 08:01:47,097 INFO L87 Difference]: Start difference. First operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-04-08 08:01:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,107 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-08 08:01:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-08 08:01:47,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:47,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:47,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:47,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:47,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-08 08:01:47,114 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-08 08:01:47,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:47,114 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-08 08:01:47,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-08 08:01:47,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-08 08:01:47,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 08:01:47,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:47,148 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:47,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:01:47,149 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:47,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:47,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-08 08:01:47,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:47,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812827380] [2022-04-08 08:01:47,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:01:47,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-08 08:01:47,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:47,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284722276] [2022-04-08 08:01:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:47,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:47,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:01:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:47,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,268 INFO L272 TraceCheckUtils]: 0: Hoare triple {217#true} call ULTIMATE.init(); {224#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:01:47,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {224#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#(= ~counter~0 0)} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {222#(= ~counter~0 0)} is VALID [2022-04-08 08:01:47,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {223#(= |main_#t~post5| 0)} is VALID [2022-04-08 08:01:47,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {218#false} is VALID [2022-04-08 08:01:47,272 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {218#false} is VALID [2022-04-08 08:01:47,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-08 08:01:47,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-08 08:01:47,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-08 08:01:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:01:47,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:47,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284722276] [2022-04-08 08:01:47,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284722276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:47,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:47,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:01:47,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:47,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812827380] [2022-04-08 08:01:47,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812827380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:47,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:47,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:01:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223605175] [2022-04-08 08:01:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:47,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:01:47,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:47,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:01:47,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:47,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:01:47,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:01:47,287 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,415 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-08 08:01:47,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 08:01:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:01:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 08:01:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-08 08:01:47,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-08 08:01:47,456 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-08 08:01:47,457 INFO L225 Difference]: With dead ends: 32 [2022-04-08 08:01:47,457 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 08:01:47,457 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-08 08:01:47,458 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:47,458 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:01:47,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 08:01:47,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 08:01:47,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:47,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,462 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,463 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,464 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 08:01:47,464 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 08:01:47,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:47,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:47,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 08:01:47,465 INFO L87 Difference]: Start difference. First operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 23 states. [2022-04-08 08:01:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,466 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-08 08:01:47,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 08:01:47,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:47,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:47,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:47,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 08:01:47,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-08 08:01:47,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-08 08:01:47,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:47,469 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-08 08:01:47,469 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-08 08:01:47,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-08 08:01:47,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 08:01:47,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:47,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:47,503 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:01:47,503 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:47,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:47,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-08 08:01:47,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:47,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758100973] [2022-04-08 08:01:47,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:01:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-08 08:01:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:47,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934365737] [2022-04-08 08:01:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:47,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:01:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:47,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-08 08:01:47,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 08:01:47,577 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 08:01:47,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {393#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:01:47,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {385#true} is VALID [2022-04-08 08:01:47,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-08 08:01:47,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-08 08:01:47,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-08 08:01:47,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 08:01:47,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 08:01:47,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 1);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 08:01:47,581 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 08:01:47,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {392#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 08:01:47,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-08 08:01:47,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-08 08:01:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:01:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:47,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934365737] [2022-04-08 08:01:47,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934365737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:47,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:47,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:01:47,582 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:47,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758100973] [2022-04-08 08:01:47,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758100973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:47,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:47,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 08:01:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514137298] [2022-04-08 08:01:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:01:47,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:47,584 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 08:01:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:47,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 08:01:47,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:01:47,593 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,868 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-08 08:01:47,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 08:01:47,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 08:01:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 08:01:47,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-08 08:01:47,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-08 08:01:47,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,906 INFO L225 Difference]: With dead ends: 36 [2022-04-08 08:01:47,906 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 08:01:47,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 08:01:47,907 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:47,907 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 53 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:01:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 08:01:47,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-08 08:01:47,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:47,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 08:01:47,917 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 08:01:47,917 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 08:01:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,919 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 08:01:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 08:01:47,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:47,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:47,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 08:01:47,921 INFO L87 Difference]: Start difference. First operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-08 08:01:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:47,924 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-08 08:01:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 08:01:47,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:47,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:47,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:47,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 08:01:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-08 08:01:47,927 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-08 08:01:47,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:47,927 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-08 08:01:47,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:01:47,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-08 08:01:47,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 08:01:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 08:01:47,963 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:47,963 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:47,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:01:47,965 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-08 08:01:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:47,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [86174458] [2022-04-08 08:01:47,969 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:01:47,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-08 08:01:47,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:47,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396811340] [2022-04-08 08:01:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:47,992 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:47,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [813931631] [2022-04-08 08:01:47,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:47,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:47,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:47,997 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-08 08:01:48,013 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-08 08:01:48,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:48,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:48,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:01:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:48,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:48,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-08 08:01:48,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {608#true} is VALID [2022-04-08 08:01:48,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 08:01:48,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-08 08:01:48,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-08 08:01:48,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {608#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,221 INFO L272 TraceCheckUtils]: 8: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {608#true} is VALID [2022-04-08 08:01:48,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-08 08:01:48,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-08 08:01:48,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-08 08:01:48,222 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {608#true} {628#(and (= main_~a~0 0) (= main_~s~0 1))} #54#return; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,222 INFO L272 TraceCheckUtils]: 13: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:48,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:48,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-08 08:01:48,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-08 08:01:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:01:48,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:01:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:48,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396811340] [2022-04-08 08:01:48,224 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:48,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813931631] [2022-04-08 08:01:48,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813931631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:48,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:48,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:01:48,225 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:48,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [86174458] [2022-04-08 08:01:48,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [86174458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:48,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:48,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:01:48,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816160441] [2022-04-08 08:01:48,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 08:01:48,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:48,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:01:48,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:48,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:01:48,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:48,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:01:48,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:01:48,238 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:01:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:48,378 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-08 08:01:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:01:48,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 08:01:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:01:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 08:01:48,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:01:48,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 08:01:48,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 08:01:48,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:48,424 INFO L225 Difference]: With dead ends: 40 [2022-04-08 08:01:48,424 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 08:01:48,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-08 08:01:48,425 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:48,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:01:48,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 08:01:48,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-08 08:01:48,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:48,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 08:01:48,456 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 08:01:48,456 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 08:01:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:48,458 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 08:01:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 08:01:48,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:48,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:48,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 08:01:48,460 INFO L87 Difference]: Start difference. First operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 38 states. [2022-04-08 08:01:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:48,461 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 08:01:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-08 08:01:48,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:48,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:48,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:48,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 08:01:48,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-08 08:01:48,464 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-08 08:01:48,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:48,464 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-08 08:01:48,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:01:48,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-08 08:01:48,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-08 08:01:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:01:48,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:48,500 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:48,520 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-08 08:01:48,715 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:48,716 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-08 08:01:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [936871289] [2022-04-08 08:01:48,717 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:01:48,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-08 08:01:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:01:48,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825355118] [2022-04-08 08:01:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:01:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:01:48,729 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 08:01:48,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [574117811] [2022-04-08 08:01:48,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 08:01:48,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:48,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:01:48,735 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-08 08:01:48,777 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-08 08:01:48,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 08:01:48,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 08:01:48,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 08:01:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:01:48,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 08:01:48,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-08 08:01:48,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {895#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {895#true} is VALID [2022-04-08 08:01:48,935 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 08:01:48,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-08 08:01:48,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-08 08:01:48,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {895#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 1);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,937 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {895#true} is VALID [2022-04-08 08:01:48,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 08:01:48,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 08:01:48,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 08:01:48,940 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #54#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,941 INFO L272 TraceCheckUtils]: 13: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {895#true} is VALID [2022-04-08 08:01:48,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-08 08:01:48,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-08 08:01:48,941 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-08 08:01:48,942 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {895#true} {915#(and (= main_~t~0 1) (= main_~s~0 1))} #56#return; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 08:01:48,943 INFO L272 TraceCheckUtils]: 18: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {955#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 08:01:48,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 08:01:48,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-08 08:01:48,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-08 08:01:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 08:01:48,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 08:01:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:01:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825355118] [2022-04-08 08:01:48,945 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 08:01:48,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574117811] [2022-04-08 08:01:48,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574117811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:48,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:48,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:01:48,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:01:48,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [936871289] [2022-04-08 08:01:48,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [936871289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:01:48,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:01:48,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 08:01:48,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039369073] [2022-04-08 08:01:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:01:48,947 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 08:01:48,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:01:48,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:01:48,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:48,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 08:01:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 08:01:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:01:48,963 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:01:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:49,072 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-08 08:01:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 08:01:49,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 08:01:49,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:01:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:01:49,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 08:01:49,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:01:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 08:01:49,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 08:01:49,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:49,104 INFO L225 Difference]: With dead ends: 44 [2022-04-08 08:01:49,104 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 08:01:49,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 08:01:49,106 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:01:49,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:01:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 08:01:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 08:01:49,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:01:49,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 08:01:49,122 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 08:01:49,122 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 08:01:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:49,124 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 08:01:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 08:01:49,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:49,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:49,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 08:01:49,126 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 39 states. [2022-04-08 08:01:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:01:49,130 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 08:01:49,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 08:01:49,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:01:49,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:01:49,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:01:49,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:01:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 08:01:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-08 08:01:49,132 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-08 08:01:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:01:49,133 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-08 08:01:49,133 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 08:01:49,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-08 08:01:49,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:01:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-08 08:01:49,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 08:01:49,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:01:49,166 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:01:49,197 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-08 08:01:49,379 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 08:01:49,380 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:01:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:01:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-08 08:01:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:01:49,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [109184460] [2022-04-08 08:01:53,576 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=2, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 08:01:53,583 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post5_8|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 08:01:53,589 INFO L158 Benchmark]: Toolchain (without parser) took 7590.68ms. Allocated memory was 163.6MB in the beginning and 206.6MB in the end (delta: 43.0MB). Free memory was 113.6MB in the beginning and 109.1MB in the end (delta: 4.5MB). Peak memory consumption was 85.2MB. Max. memory is 8.0GB. [2022-04-08 08:01:53,590 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 163.6MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:01:53,590 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.47ms. Allocated memory is still 163.6MB. Free memory was 113.4MB in the beginning and 138.7MB in the end (delta: -25.4MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-08 08:01:53,590 INFO L158 Benchmark]: Boogie Preprocessor took 32.14ms. Allocated memory is still 163.6MB. Free memory was 138.7MB in the beginning and 137.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 08:01:53,591 INFO L158 Benchmark]: RCFGBuilder took 227.37ms. Allocated memory is still 163.6MB. Free memory was 137.1MB in the beginning and 126.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 08:01:53,591 INFO L158 Benchmark]: TraceAbstraction took 7110.46ms. Allocated memory was 163.6MB in the beginning and 206.6MB in the end (delta: 43.0MB). Free memory was 125.9MB in the beginning and 109.1MB in the end (delta: 16.8MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. [2022-04-08 08:01:53,592 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.76ms. Allocated memory is still 163.6MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.47ms. Allocated memory is still 163.6MB. Free memory was 113.4MB in the beginning and 138.7MB in the end (delta: -25.4MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.14ms. Allocated memory is still 163.6MB. Free memory was 138.7MB in the beginning and 137.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.37ms. Allocated memory is still 163.6MB. Free memory was 137.1MB in the beginning and 126.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7110.46ms. Allocated memory was 163.6MB in the beginning and 206.6MB in the end (delta: 43.0MB). Free memory was 125.9MB in the beginning and 109.1MB in the end (delta: 16.8MB). Peak memory consumption was 97.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post5_8|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post5_8|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 08:01:53,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...