/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:01:11,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:01:11,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:01:11,230 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:01:11,230 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:01:11,231 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:01:11,232 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:01:11,233 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:01:11,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:01:11,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:01:11,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:01:11,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:01:11,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:01:11,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:01:11,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:01:11,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:01:11,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:01:11,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:01:11,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:01:11,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:01:11,254 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:01:11,255 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:01:11,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:01:11,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:01:11,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:01:11,263 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:01:11,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:01:11,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:01:11,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:01:11,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:01:11,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:01:11,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:01:11,265 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:01:11,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:01:11,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:01:11,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:01:11,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:01:11,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:01:11,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:01:11,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:01:11,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:01:11,272 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:01:11,272 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:01:11,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:01:11,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:01:11,283 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:01:11,283 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:01:11,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:01:11,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:01:11,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:01:11,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:01:11,284 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:01:11,284 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:01:11,284 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:01:11,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:01:11,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:01:11,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:01:11,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:01:11,286 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:01:11,286 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:01:11,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:01:11,286 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:01:11,286 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:01:11,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:01:11,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:01:11,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:01:11,502 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:01:11,504 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:01:11,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2022-04-28 08:01:11,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae596a26/8123204bbe1f48ba9f2d4c56cbfffd51/FLAG4e518ebde [2022-04-28 08:01:11,902 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:01:11,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2022-04-28 08:01:11,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae596a26/8123204bbe1f48ba9f2d4c56cbfffd51/FLAG4e518ebde [2022-04-28 08:01:12,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ae596a26/8123204bbe1f48ba9f2d4c56cbfffd51 [2022-04-28 08:01:12,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:01:12,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:01:12,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:01:12,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:01:12,358 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:01:12,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f5b3ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12, skipping insertion in model container [2022-04-28 08:01:12,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:01:12,377 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:01:12,521 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_unwindbound5.c[520,533] [2022-04-28 08:01:12,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:01:12,548 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:01:12,556 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_unwindbound5.c[520,533] [2022-04-28 08:01:12,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:01:12,579 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:01:12,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12 WrapperNode [2022-04-28 08:01:12,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:01:12,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:01:12,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:01:12,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:01:12,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:01:12,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:01:12,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:01:12,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:01:12,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (1/1) ... [2022-04-28 08:01:12,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:01:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:12,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:01:12,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:01:12,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:01:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:01:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:01:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 08:01:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 08:01:12,679 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:01:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:01:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:01:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:01:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:01:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:01:12,679 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:01:12,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:01:12,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:01:12,721 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:01:12,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:01:12,833 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:01:12,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:01:12,838 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:01:12,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:01:12 BoogieIcfgContainer [2022-04-28 08:01:12,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:01:12,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:01:12,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:01:12,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:01:12,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:01:12" (1/3) ... [2022-04-28 08:01:12,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdb9865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:01:12, skipping insertion in model container [2022-04-28 08:01:12,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:01:12" (2/3) ... [2022-04-28 08:01:12,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdb9865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:01:12, skipping insertion in model container [2022-04-28 08:01:12,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:01:12" (3/3) ... [2022-04-28 08:01:12,854 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound5.c [2022-04-28 08:01:12,877 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:01:12,877 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:01:12,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:01:12,925 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7809fffc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fc8703d [2022-04-28 08:01:12,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:01:12,932 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-28 08:01:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 08:01:12,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:12,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:12,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:12,942 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 1 times [2022-04-28 08:01:12,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:12,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176531722] [2022-04-28 08:01:12,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:12,956 INFO L85 PathProgramCache]: Analyzing trace with hash -643130361, now seen corresponding path program 2 times [2022-04-28 08:01:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:12,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532294355] [2022-04-28 08:01:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:12,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:13,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:01:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:13,077 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-28 08:01:13,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 08:01:13,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 08:01:13,080 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-28 08:01:13,080 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-28 08:01:13,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-28 08:01:13,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #66#return; {29#true} is VALID [2022-04-28 08:01:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2022-04-28 08:01:13,081 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-28 08:01:13,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-28 08:01:13,082 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-28 08:01:13,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-28 08:01:13,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-28 08:01:13,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-28 08:01:13,083 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-28 08:01:13,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532294355] [2022-04-28 08:01:13,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532294355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:13,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:13,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:01:13,086 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:13,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176531722] [2022-04-28 08:01:13,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176531722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:13,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:13,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:01:13,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533578836] [2022-04-28 08:01:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:13,091 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-28 08:01:13,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:13,095 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-28 08:01:13,108 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-28 08:01:13,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 08:01:13,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:13,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 08:01:13,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 08:01:13,138 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-28 08:01:13,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:13,293 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-04-28 08:01:13,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 08:01:13,294 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-28 08:01:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:13,297 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-28 08:01:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 08:01:13,311 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-28 08:01:13,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-28 08:01:13,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-28 08:01:13,384 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-28 08:01:13,390 INFO L225 Difference]: With dead ends: 47 [2022-04-28 08:01:13,390 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 08:01:13,392 INFO L412 NwaCegarLoop]: 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-28 08:01:13,395 INFO L413 NwaCegarLoop]: 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-28 08:01:13,395 INFO L414 NwaCegarLoop]: 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-28 08:01:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 08:01:13,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 08:01:13,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:13,417 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-28 08:01:13,418 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-28 08:01:13,418 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-28 08:01:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:13,421 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 08:01:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 08:01:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:13,442 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-28 08:01:13,442 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-28 08:01:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:13,452 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-04-28 08:01:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 08:01:13,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:13,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:13,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:13,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:13,453 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-28 08:01:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-04-28 08:01:13,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2022-04-28 08:01:13,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:13,456 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-04-28 08:01:13,456 INFO L496 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-28 08:01:13,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 27 transitions. [2022-04-28 08:01:13,477 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-28 08:01:13,478 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-28 08:01:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 08:01:13,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:13,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:13,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:01:13,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:13,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 1 times [2022-04-28 08:01:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:13,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308155372] [2022-04-28 08:01:13,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1070997212, now seen corresponding path program 2 times [2022-04-28 08:01:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512924326] [2022-04-28 08:01:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:13,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:01:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:13,553 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-28 08:01:13,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:01:13,554 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:01:13,554 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-28 08:01:13,555 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-28 08:01:13,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#(= ~counter~0 0)} assume true; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:01:13,556 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#(= ~counter~0 0)} {217#true} #66#return; {222#(= ~counter~0 0)} is VALID [2022-04-28 08:01:13,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#(= ~counter~0 0)} call #t~ret6 := main(); {222#(= ~counter~0 0)} is VALID [2022-04-28 08:01:13,556 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-28 08:01:13,557 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-28 08:01:13,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {218#false} is VALID [2022-04-28 08:01:13,558 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-28 08:01:13,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#false} ~cond := #in~cond; {218#false} is VALID [2022-04-28 08:01:13,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#false} assume 0 == ~cond; {218#false} is VALID [2022-04-28 08:01:13,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#false} assume !false; {218#false} is VALID [2022-04-28 08:01:13,558 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-28 08:01:13,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:13,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512924326] [2022-04-28 08:01:13,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512924326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:13,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:13,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:01:13,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:13,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308155372] [2022-04-28 08:01:13,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308155372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:13,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:13,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:01:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367204105] [2022-04-28 08:01:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:13,568 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-28 08:01:13,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:13,568 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-28 08:01:13,578 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-28 08:01:13,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:01:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:13,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:01:13,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:01:13,580 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-28 08:01:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:13,724 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 08:01:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 08:01:13,724 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-28 08:01:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:13,725 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-28 08:01:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 08:01:13,733 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-28 08:01:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 08:01:13,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 08:01:13,765 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-28 08:01:13,767 INFO L225 Difference]: With dead ends: 32 [2022-04-28 08:01:13,768 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 08:01:13,768 INFO L412 NwaCegarLoop]: 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-28 08:01:13,769 INFO L413 NwaCegarLoop]: 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-28 08:01:13,769 INFO L414 NwaCegarLoop]: 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-28 08:01:13,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 08:01:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 08:01:13,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:13,780 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-28 08:01:13,780 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-28 08:01:13,781 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-28 08:01:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:13,786 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 08:01:13,786 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 08:01:13,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:13,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:13,788 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-28 08:01:13,788 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-28 08:01:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:13,790 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 08:01:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 08:01:13,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:13,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:13,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:13,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:13,793 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-28 08:01:13,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 08:01:13,794 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 12 [2022-04-28 08:01:13,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:13,794 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 08:01:13,795 INFO L496 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-28 08:01:13,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 08:01:13,827 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-28 08:01:13,827 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 08:01:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 08:01:13,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:13,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:13,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:01:13,836 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 1 times [2022-04-28 08:01:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1564274414] [2022-04-28 08:01:13,839 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1072665508, now seen corresponding path program 2 times [2022-04-28 08:01:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:13,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164158814] [2022-04-28 08:01:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:13,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:01:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:13,956 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-28 08:01:13,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 08:01:13,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 08:01:13,957 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-28 08:01:13,958 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-28 08:01:13,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 08:01:13,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #66#return; {385#true} is VALID [2022-04-28 08:01:13,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret6 := main(); {385#true} is VALID [2022-04-28 08:01:13,962 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-28 08:01:13,963 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-28 08:01:13,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !!(#t~post5 < 5);havoc #t~post5; {390#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 08:01:13,969 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-28 08:01:13,970 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-28 08:01:13,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {392#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 08:01:13,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 08:01:13,971 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-28 08:01:13,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:13,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164158814] [2022-04-28 08:01:13,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164158814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:13,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:13,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:01:13,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:13,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1564274414] [2022-04-28 08:01:13,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1564274414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:13,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:13,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:01:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715114881] [2022-04-28 08:01:13,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:13,975 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-28 08:01:13,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:13,975 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-28 08:01:13,984 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-28 08:01:13,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:01:13,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:13,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:01:13,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:01:13,985 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-28 08:01:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:14,280 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 08:01:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 08:01:14,280 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-28 08:01:14,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:14,280 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-28 08:01:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 08:01:14,282 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-28 08:01:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-28 08:01:14,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-28 08:01:14,321 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-28 08:01:14,323 INFO L225 Difference]: With dead ends: 36 [2022-04-28 08:01:14,323 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 08:01:14,323 INFO L412 NwaCegarLoop]: 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-28 08:01:14,324 INFO L413 NwaCegarLoop]: 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-28 08:01:14,324 INFO L414 NwaCegarLoop]: 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-28 08:01:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 08:01:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 08:01:14,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:14,329 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-28 08:01:14,330 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-28 08:01:14,330 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-28 08:01:14,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:14,332 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 08:01:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 08:01:14,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:14,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:14,333 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-28 08:01:14,333 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-28 08:01:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:14,335 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 08:01:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 08:01:14,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:14,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:14,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:14,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:14,336 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-28 08:01:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-28 08:01:14,337 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-28 08:01:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:14,347 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-28 08:01:14,347 INFO L496 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-28 08:01:14,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-28 08:01:14,384 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-28 08:01:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-28 08:01:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:01:14,385 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:14,385 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:14,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:01:14,386 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 1 times [2022-04-28 08:01:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:14,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242231715] [2022-04-28 08:01:14,387 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:14,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1640566567, now seen corresponding path program 2 times [2022-04-28 08:01:14,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:14,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655187409] [2022-04-28 08:01:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:14,398 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:14,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1235098100] [2022-04-28 08:01:14,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:01:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:14,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:14,411 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:01:14,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 08:01:14,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:01:14,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:01:14,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:01:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:14,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:14,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {608#true} call ULTIMATE.init(); {608#true} is VALID [2022-04-28 08:01:14,649 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-28 08:01:14,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 08:01:14,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {608#true} {608#true} #66#return; {608#true} is VALID [2022-04-28 08:01:14,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {608#true} call #t~ret6 := main(); {608#true} is VALID [2022-04-28 08:01:14,653 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-28 08:01:14,654 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-28 08:01:14,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {628#(and (= main_~a~0 0) (= main_~s~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {628#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:01:14,655 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-28 08:01:14,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {608#true} ~cond := #in~cond; {608#true} is VALID [2022-04-28 08:01:14,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {608#true} assume !(0 == ~cond); {608#true} is VALID [2022-04-28 08:01:14,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {608#true} assume true; {608#true} is VALID [2022-04-28 08:01:14,659 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-28 08:01:14,660 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-28 08:01:14,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:14,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {609#false} is VALID [2022-04-28 08:01:14,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {609#false} assume !false; {609#false} is VALID [2022-04-28 08:01:14,662 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-28 08:01:14,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:14,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655187409] [2022-04-28 08:01:14,663 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:14,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235098100] [2022-04-28 08:01:14,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235098100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:14,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:14,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:14,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242231715] [2022-04-28 08:01:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242231715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886627222] [2022-04-28 08:01:14,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:14,671 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-28 08:01:14,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:14,671 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-28 08:01:14,683 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-28 08:01:14,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:01:14,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:14,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:01:14,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:01:14,685 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-28 08:01:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:14,821 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 08:01:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:01:14,822 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-28 08:01:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:14,822 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-28 08:01:14,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:01:14,825 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-28 08:01:14,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:01:14,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 08:01:14,858 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-28 08:01:14,861 INFO L225 Difference]: With dead ends: 40 [2022-04-28 08:01:14,861 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 08:01:14,861 INFO L412 NwaCegarLoop]: 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-28 08:01:14,863 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:01:14,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 88 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:01:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 08:01:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-04-28 08:01:14,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:14,884 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-28 08:01:14,884 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-28 08:01:14,884 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-28 08:01:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:14,887 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:01:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:01:14,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:14,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:14,889 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-28 08:01:14,889 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-28 08:01:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:14,893 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:01:14,894 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:01:14,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:14,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:14,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:14,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:14,895 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-28 08:01:14,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-28 08:01:14,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 17 [2022-04-28 08:01:14,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:14,897 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-28 08:01:14,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-28 08:01:14,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 47 transitions. [2022-04-28 08:01:14,933 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-28 08:01:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-28 08:01:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:01:14,933 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:14,933 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:01:14,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 08:01:15,149 WARN L477 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-28 08:01:15,150 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:15,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 1 times [2022-04-28 08:01:15,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:15,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1960173023] [2022-04-28 08:01:15,151 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:01:15,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1129080132, now seen corresponding path program 2 times [2022-04-28 08:01:15,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:15,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330384027] [2022-04-28 08:01:15,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:15,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:15,162 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98232715] [2022-04-28 08:01:15,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:01:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:15,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:15,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:01:15,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 08:01:15,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:01:15,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:01:15,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:01:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:15,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:15,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {895#true} call ULTIMATE.init(); {895#true} is VALID [2022-04-28 08:01:15,324 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-28 08:01:15,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 08:01:15,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {895#true} {895#true} #66#return; {895#true} is VALID [2022-04-28 08:01:15,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {895#true} call #t~ret6 := main(); {895#true} is VALID [2022-04-28 08:01:15,325 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-28 08:01:15,326 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-28 08:01:15,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {915#(and (= main_~t~0 1) (= main_~s~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {915#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:01:15,327 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-28 08:01:15,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 08:01:15,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 08:01:15,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 08:01:15,327 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-28 08:01:15,328 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-28 08:01:15,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {895#true} ~cond := #in~cond; {895#true} is VALID [2022-04-28 08:01:15,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {895#true} assume !(0 == ~cond); {895#true} is VALID [2022-04-28 08:01:15,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {895#true} assume true; {895#true} is VALID [2022-04-28 08:01:15,329 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-28 08:01:15,329 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-28 08:01:15,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {955#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {959#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:15,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {959#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {896#false} is VALID [2022-04-28 08:01:15,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#false} assume !false; {896#false} is VALID [2022-04-28 08:01:15,330 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-28 08:01:15,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:15,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330384027] [2022-04-28 08:01:15,331 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:15,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98232715] [2022-04-28 08:01:15,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98232715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:15,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:15,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:15,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:01:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1960173023] [2022-04-28 08:01:15,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1960173023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:15,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:15,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:01:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042661658] [2022-04-28 08:01:15,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:01:15,332 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-28 08:01:15,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:01:15,333 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-28 08:01:15,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:01:15,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:01:15,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:01:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:01:15,345 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-28 08:01:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:15,487 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 08:01:15,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:01:15,488 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-28 08:01:15,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:01:15,488 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-28 08:01:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:01:15,489 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-28 08:01:15,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 08:01:15,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 08:01:15,526 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-28 08:01:15,528 INFO L225 Difference]: With dead ends: 44 [2022-04-28 08:01:15,528 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 08:01:15,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:01:15,530 INFO L413 NwaCegarLoop]: 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-28 08:01:15,530 INFO L414 NwaCegarLoop]: 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-28 08:01:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 08:01:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 08:01:15,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:01:15,543 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-28 08:01:15,544 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-28 08:01:15,544 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-28 08:01:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:15,546 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 08:01:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 08:01:15,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:15,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:15,547 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-28 08:01:15,547 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-28 08:01:15,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:01:15,551 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-28 08:01:15,551 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 08:01:15,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:01:15,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:01:15,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:01:15,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:01:15,552 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-28 08:01:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-04-28 08:01:15,553 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2022-04-28 08:01:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:01:15,553 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-04-28 08:01:15,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 08:01:15,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 45 transitions. [2022-04-28 08:01:15,587 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-28 08:01:15,587 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-04-28 08:01:15,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:01:15,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:01:15,588 INFO L195 NwaCegarLoop]: 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-28 08:01:15,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 08:01:15,800 WARN L477 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-28 08:01:15,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:01:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:01:15,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1326533350, now seen corresponding path program 1 times [2022-04-28 08:01:15,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:01:15,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335479565] [2022-04-28 08:01:22,641 WARN L232 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 135 DAG size of output: 128 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-28 08:01:22,671 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-28 08:01:22,675 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:01:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1831963292, now seen corresponding path program 1 times [2022-04-28 08:01:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:01:22,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144928354] [2022-04-28 08:01:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:01:22,693 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:01:22,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124164066] [2022-04-28 08:01:22,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:01:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:01:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:01:22,694 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 08:01:22,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 08:01:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:22,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 08:01:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:01:22,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:01:39,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 08:01:39,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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; {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:39,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {1219#(= ~counter~0 0)} assume true; {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:39,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1219#(= ~counter~0 0)} {1211#true} #66#return; {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:39,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {1219#(= ~counter~0 0)} call #t~ret6 := main(); {1219#(= ~counter~0 0)} is VALID [2022-04-28 08:01:39,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {1219#(= ~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; {1232#(and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0))} is VALID [2022-04-28 08:01:39,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {1232#(and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0))} [70] L30-3-->L30-1_primed: Formula: (let ((.cse9 (* 2 v_main_~a~0_19))) (let ((.cse3 (< v_~counter~0_9 5)) (.cse1 (<= v_main_~s~0_20 v_main_~n~0_6)) (.cse2 (= v_main_~t~0_19 (+ .cse9 1))) (.cse0 (= |v_main_#t~post5_8| |v_main_#t~post5_6|)) (.cse4 (= v_main_~a~0_19 v_main_~a~0_18)) (.cse5 (= v_~counter~0_9 v_~counter~0_8)) (.cse6 (= v_main_~t~0_19 v_main_~t~0_18))) (or (and .cse0 (or (not .cse1) (not .cse2) (not .cse3) (not (= (* v_main_~s~0_20 4) (+ (* v_main_~t~0_19 v_main_~t~0_19) (* v_main_~t~0_19 2) 1)))) .cse4 .cse5 .cse6 (= v_main_~s~0_19 v_main_~s~0_20)) (let ((.cse11 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (let ((.cse10 (* .cse11 2))) (and (forall ((v_itHalf_1 Int)) (or (let ((.cse8 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse7 (* v_itHalf_1 2))) (and (< (+ v_~counter~0_9 .cse7) 5) (= (+ v_main_~s~0_20 .cse8) (+ (* (* v_itHalf_1 v_main_~a~0_19) 4) (* v_main_~a~0_19 v_main_~a~0_19) (* 2 v_main_~a~0_19) .cse7 1)) (<= (+ v_main_~s~0_20 .cse8 .cse7 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6))) (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (not (<= 1 v_itHalf_1)))) (= (+ (* v_main_~a~0_19 v_main_~a~0_19) .cse9 1) v_main_~s~0_20) .cse3 .cse1 (= (mod (+ v_main_~t~0_19 (* v_main_~t~0_18 3) 2) 4) 0) (= (+ .cse10 1 v_main_~a~0_19) v_main_~a~0_18) (<= 0 .cse11) .cse2 (= v_main_~s~0_19 (+ v_main_~s~0_20 v_main_~t~0_19 (* (* v_main_~t~0_19 .cse11) 2) 2 (* (* .cse11 .cse11) 4) (* .cse11 6))) (= v_~counter~0_8 (+ .cse10 v_~counter~0_9 1))))) (let ((.cse13 (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (let ((.cse12 (* 2 .cse13))) (and (= (+ .cse12 v_main_~a~0_19) v_main_~a~0_18) (= v_main_~s~0_19 (+ v_main_~s~0_20 (* (* .cse13 .cse13) 4) (* 2 (* v_main_~t~0_19 .cse13)) .cse12)) .cse1 (= v_main_~t~0_18 (+ v_main_~t~0_19 (* .cse13 4))) (= (mod (+ v_~counter~0_9 v_~counter~0_8) 2) 0) .cse2 (< 0 .cse13) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ v_~counter~0_9 (* (- 1) v_~counter~0_8)) (- 2)))) (not (<= 0 v_itHalf_1)) (let ((.cse14 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse15 (* v_itHalf_1 2))) (and (<= (+ v_main_~s~0_20 v_main_~t~0_19 2 (* v_itHalf_1 6) .cse14 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (< (+ v_~counter~0_9 .cse15) 4) (= (+ v_main_~s~0_20 v_main_~t~0_19 .cse14) (+ (* 4 v_main_~a~0_19) (* (* v_itHalf_1 v_main_~a~0_19) 4) 2 (* v_main_~a~0_19 v_main_~a~0_19) .cse15))))))))) (and (= v_main_~n~0_6 v_main_~n~0_6) .cse0 (= v_main_~s~0_20 v_main_~s~0_19) .cse4 .cse5 .cse6)))) InVars {~counter~0=v_~counter~0_9, main_~t~0=v_main_~t~0_19, main_#t~post5=|v_main_#t~post5_8|, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_20, main_~a~0=v_main_~a~0_19} OutVars{~counter~0=v_~counter~0_8, main_~t~0=v_main_~t~0_18, main_#t~post5=|v_main_#t~post5_6|, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_19, main_~a~0=v_main_~a~0_18} AuxVars[] AssignedVars[~counter~0, main_~t~0, main_#t~post5, main_~s~0, main_~a~0] {1236#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 5) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)))))) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (forall ((v_itHalf_1 Int)) (or (and (= (+ 2 (* v_itHalf_1 2)) (+ (* (div (* ~counter~0 (- 1)) (- 2)) (- 4)) main_~s~0 (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2)) (- 4)) (* v_itHalf_1 2) 1)) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (< (* v_itHalf_1 2) 4)) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))))))) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)) (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)))} is VALID [2022-04-28 08:01:39,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {1236#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 5) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)))))) (= ~counter~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= main_~a~0 (* (div (* ~counter~0 (- 1)) (- 2)) 2)) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (forall ((v_itHalf_1 Int)) (or (and (= (+ 2 (* v_itHalf_1 2)) (+ (* (div (* ~counter~0 (- 1)) (- 2)) (- 4)) main_~s~0 (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2)) (- 4)) (* v_itHalf_1 2) 1)) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ (* (* (div (* ~counter~0 (- 1)) (- 2)) (div (* ~counter~0 (- 1)) (- 2))) 4) main_~n~0 (* (div (* ~counter~0 (- 1)) (- 2)) 4))) (< (* v_itHalf_1 2) 4)) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* ~counter~0 (- 1)) (- 2)))))))) (< 0 (div (* ~counter~0 (- 1)) (- 2))) (= (mod ~counter~0 2) 0) (= (+ (* (div (* ~counter~0 (- 1)) (- 2)) 4) 1) main_~t~0)) (and (= main_~a~0 0) (= main_~t~0 1) (= ~counter~0 0)))} [69] L30-1_primed-->L30-1: Formula: (and (= |v_main_#t~post5_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post5_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post5=|v_main_#t~post5_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post5] {1240#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 5) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)))))) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1)) (< (* v_itHalf_1 2) 4)))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} is VALID [2022-04-28 08:01:39,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {1240#(or (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 5) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)))))) (<= |main_#t~post5| (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1))) (and (= (mod (+ (* main_~t~0 3) 1) 4) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (not (<= 0 v_itHalf_1)) (and (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* 4 (div (+ (* (- 1) main_~t~0) 1) (- 4))) (* (* (div (+ (* (- 1) main_~t~0) 1) (- 4)) (div (+ (* (- 1) main_~t~0) 1) (- 4))) 4))) (= main_~s~0 (+ (* (* (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2)) (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 4) (* 4 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) 1)) (< (* v_itHalf_1 2) 4)))))) (<= |main_#t~post5| (* 2 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (= (* 2 (div (* (- 2) (div (+ (* (- 1) main_~t~0) 1) (- 4))) (- 2))) main_~a~0) (< 0 (div (+ (* (- 1) main_~t~0) 1) (- 4)))) (and (= main_~a~0 0) (<= |main_#t~post5| 0) (= main_~t~0 1)))} assume !(#t~post5 < 5);havoc #t~post5; {1244#(and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 5) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)))))) (<= 4 (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))))} is VALID [2022-04-28 08:01:39,427 INFO L272 TraceCheckUtils]: 9: Hoare triple {1244#(and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (and (< (* v_itHalf_1 2) 5) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)) (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)))))) (<= 4 (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:01:39,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:01:39,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 08:01:39,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 08:01:39,428 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-28 08:01:39,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:01:39,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:01:39,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144928354] [2022-04-28 08:01:39,429 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:01:39,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124164066] [2022-04-28 08:01:39,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124164066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:01:39,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:01:39,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 08:02:25,705 WARN L232 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 129 DAG size of output: 126 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)