/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_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:03:51,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:03:51,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:03:51,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:03:51,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:03:51,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:03:51,499 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:03:51,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:03:51,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:03:51,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:03:51,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:03:51,504 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:03:51,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:03:51,505 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:03:51,506 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:03:51,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:03:51,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:03:51,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:03:51,509 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:03:51,511 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:03:51,512 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:03:51,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:03:51,513 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:03:51,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:03:51,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:03:51,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:03:51,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:03:51,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:03:51,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:03:51,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:03:51,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:03:51,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:03:51,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:03:51,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:03:51,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:03:51,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:03:51,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:03:51,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:03:51,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:03:51,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:03:51,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:03:51,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:03:51,527 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:03:51,535 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:03:51,536 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:03:51,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:03:51,537 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:03:51,537 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:03:51,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:03:51,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:03:51,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:03:51,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:03:51,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:03:51,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:03:51,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:03:51,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:03:51,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:03:51,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:03:51,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:03:51,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:03:51,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:03:51,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:03:51,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:03:51,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:03:51,540 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:03:51,540 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:03:51,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:03:51,541 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:03:51,541 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:03:51,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:03:51,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:03:51,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:03:51,753 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:03:51,754 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:03:51,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound50.c [2022-04-28 08:03:51,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b288da9d/e460c5975a6e4e6485aa458053dcb32d/FLAGf66c1356a [2022-04-28 08:03:52,221 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:03:52,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_valuebound50.c [2022-04-28 08:03:52,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b288da9d/e460c5975a6e4e6485aa458053dcb32d/FLAGf66c1356a [2022-04-28 08:03:52,653 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b288da9d/e460c5975a6e4e6485aa458053dcb32d [2022-04-28 08:03:52,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:03:52,656 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:03:52,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:03:52,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:03:52,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:03:52,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d95b343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52, skipping insertion in model container [2022-04-28 08:03:52,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,673 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:03:52,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:03:52,808 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_valuebound50.c[520,533] [2022-04-28 08:03:52,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:03:52,856 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:03:52,866 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_valuebound50.c[520,533] [2022-04-28 08:03:52,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:03:52,884 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:03:52,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52 WrapperNode [2022-04-28 08:03:52,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:03:52,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:03:52,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:03:52,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:03:52,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:03:52,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:03:52,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:03:52,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:03:52,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (1/1) ... [2022-04-28 08:03:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:03:52,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:03:52,968 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:03:52,973 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:03:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:03:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:03:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:03:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 08:03:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 08:03:52,999 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:03:52,999 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:03:53,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:03:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:03:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:03:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:03:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:03:53,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:03:53,049 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:03:53,051 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:03:53,242 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:03:53,248 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:03:53,248 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:03:53,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:03:53 BoogieIcfgContainer [2022-04-28 08:03:53,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:03:53,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:03:53,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:03:53,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:03:53,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:03:52" (1/3) ... [2022-04-28 08:03:53,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367125d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:03:53, skipping insertion in model container [2022-04-28 08:03:53,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:03:52" (2/3) ... [2022-04-28 08:03:53,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@367125d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:03:53, skipping insertion in model container [2022-04-28 08:03:53,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:03:53" (3/3) ... [2022-04-28 08:03:53,257 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_valuebound50.c [2022-04-28 08:03:53,291 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:03:53,291 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:03:53,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:03:53,374 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@7d0e5560, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c158355 [2022-04-28 08:03:53,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:03:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 08:03:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:03:53,394 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:03:53,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:03:53,395 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:03:53,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:03:53,405 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 1 times [2022-04-28 08:03:53,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:53,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [406821590] [2022-04-28 08:03:53,427 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:03:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash 326851384, now seen corresponding path program 2 times [2022-04-28 08:03:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:03:53,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244023501] [2022-04-28 08:03:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:03:53,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:03:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:03:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:53,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 08:03:53,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 08:03:53,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 08:03:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:03:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:53,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 08:03:53,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 08:03:53,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 08:03:53,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 08:03:53,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:03:53,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {34#true} is VALID [2022-04-28 08:03:53,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-28 08:03:53,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #69#return; {34#true} is VALID [2022-04-28 08:03:53,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret5 := main(); {34#true} is VALID [2022-04-28 08:03:53,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2022-04-28 08:03:53,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {34#true} is VALID [2022-04-28 08:03:53,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-28 08:03:53,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-28 08:03:53,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-28 08:03:53,655 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #55#return; {35#false} is VALID [2022-04-28 08:03:53,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {35#false} is VALID [2022-04-28 08:03:53,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#false} assume false; {35#false} is VALID [2022-04-28 08:03:53,657 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {35#false} is VALID [2022-04-28 08:03:53,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-28 08:03:53,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-28 08:03:53,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-28 08:03:53,658 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:03:53,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:03:53,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244023501] [2022-04-28 08:03:53,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244023501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:53,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:53,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:03:53,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:03:53,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [406821590] [2022-04-28 08:03:53,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [406821590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:53,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:53,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 08:03:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617066496] [2022-04-28 08:03:53,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:03:53,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 08:03:53,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:03:53,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:53,715 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:03:53,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 08:03:53,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:53,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 08:03:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 08:03:53,743 INFO L87 Difference]: Start difference. First operand has 31 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:53,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:53,861 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2022-04-28 08:03:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 08:03:53,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 08:03:53,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:03:53,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 08:03:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2022-04-28 08:03:53,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2022-04-28 08:03:53,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:53,989 INFO L225 Difference]: With dead ends: 53 [2022-04-28 08:03:53,989 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 08:03:53,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:03:53,996 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:03:53,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:03:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 08:03:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 08:03:54,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:03:54,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 08:03:54,038 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 08:03:54,039 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 08:03:54,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:54,048 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 08:03:54,048 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 08:03:54,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:54,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:54,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 08:03:54,050 INFO L87 Difference]: Start difference. First operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 26 states. [2022-04-28 08:03:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:54,054 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-28 08:03:54,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 08:03:54,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:54,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:54,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:03:54,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:03:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 08:03:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-28 08:03:54,071 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-04-28 08:03:54,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:03:54,072 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-28 08:03:54,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:54,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-28 08:03:54,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-28 08:03:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:03:54,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:03:54,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:03:54,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:03:54,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:03:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:03:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 1 times [2022-04-28 08:03:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:54,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360647239] [2022-04-28 08:03:54,119 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:03:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1008578050, now seen corresponding path program 2 times [2022-04-28 08:03:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:03:54,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988166916] [2022-04-28 08:03:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:03:54,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:03:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:03:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:54,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 08:03:54,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:03:54,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 08:03:54,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 08:03:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:54,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 08:03:54,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 08:03:54,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:03:54,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 08:03:54,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:03:54,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-28 08:03:54,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:03:54,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #69#return; {256#true} is VALID [2022-04-28 08:03:54,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-28 08:03:54,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#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; {256#true} is VALID [2022-04-28 08:03:54,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {256#true} is VALID [2022-04-28 08:03:54,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-28 08:03:54,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-28 08:03:54,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-28 08:03:54,310 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #55#return; {256#true} is VALID [2022-04-28 08:03:54,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 08:03:54,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {265#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-28 08:03:54,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {265#(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)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 08:03:54,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 08:03:54,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-28 08:03:54,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-28 08:03:54,314 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:03:54,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:03:54,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988166916] [2022-04-28 08:03:54,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988166916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:54,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:54,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:03:54,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:03:54,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1360647239] [2022-04-28 08:03:54,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1360647239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:54,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:54,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:03:54,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477014485] [2022-04-28 08:03:54,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:03:54,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 08:03:54,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:03:54,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:54,334 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:03:54,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 08:03:54,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 08:03:54,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 08:03:54,336 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:54,821 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-28 08:03:54,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 08:03:54,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-28 08:03:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:03:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:54,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 08:03:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-04-28 08:03:54,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-04-28 08:03:54,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:54,899 INFO L225 Difference]: With dead ends: 40 [2022-04-28 08:03:54,899 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 08:03:54,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 08:03:54,901 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 08:03:54,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 39 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 08:03:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 08:03:54,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-04-28 08:03:54,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:03:54,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:03:54,911 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:03:54,911 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:03:54,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:54,914 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:03:54,914 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:03:54,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:54,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:54,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:03:54,916 INFO L87 Difference]: Start difference. First operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:03:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:54,919 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 08:03:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-28 08:03:54,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:54,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:54,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:03:54,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:03:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 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:03:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 08:03:54,922 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 17 [2022-04-28 08:03:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:03:54,923 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 08:03:54,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 08:03:54,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 08:03:54,970 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:03:54,971 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 08:03:54,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:03:54,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:03:54,972 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:03:54,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:03:54,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:03:54,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:03:54,973 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 1 times [2022-04-28 08:03:54,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:54,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855999172] [2022-04-28 08:03:54,974 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:03:54,974 INFO L85 PathProgramCache]: Analyzing trace with hash -789682422, now seen corresponding path program 2 times [2022-04-28 08:03:54,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:03:54,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654697212] [2022-04-28 08:03:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:03:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:03:54,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:03:54,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283944616] [2022-04-28 08:03:54,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:03:54,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:03:54,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:03:54,995 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:03:55,023 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:03:55,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:03:55,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:03:55,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:03:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:55,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:03:55,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 08:03:55,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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); {507#true} is VALID [2022-04-28 08:03:55,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 08:03:55,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #69#return; {507#true} is VALID [2022-04-28 08:03:55,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret5 := main(); {507#true} is VALID [2022-04-28 08:03:55,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#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; {507#true} is VALID [2022-04-28 08:03:55,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {507#true} is VALID [2022-04-28 08:03:55,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 08:03:55,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 08:03:55,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 08:03:55,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #55#return; {507#true} is VALID [2022-04-28 08:03:55,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {507#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:03:55,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:03:55,203 INFO L272 TraceCheckUtils]: 13: Hoare triple {545#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {507#true} is VALID [2022-04-28 08:03:55,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 08:03:55,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 08:03:55,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 08:03:55,204 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {507#true} {545#(and (= main_~a~0 0) (= main_~s~0 1))} #57#return; {545#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-28 08:03:55,205 INFO L272 TraceCheckUtils]: 18: Hoare triple {545#(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)); {567#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:03:55,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {567#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {571#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:03:55,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {571#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 08:03:55,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 08:03:55,206 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:03:55,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:03:55,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:03:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654697212] [2022-04-28 08:03:55,207 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:03:55,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283944616] [2022-04-28 08:03:55,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283944616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:55,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:55,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:03:55,208 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:03:55,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855999172] [2022-04-28 08:03:55,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855999172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:55,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:55,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:03:55,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599381313] [2022-04-28 08:03:55,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:03:55,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:03:55,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:55,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:03:55,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:55,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:03:55,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:03:55,243 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:55,408 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-04-28 08:03:55,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:03:55,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:03:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:03:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:03:55,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 08:03:55,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:55,468 INFO L225 Difference]: With dead ends: 44 [2022-04-28 08:03:55,468 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 08:03:55,469 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:03:55,474 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 6 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:03:55,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:03:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 08:03:55,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-04-28 08:03:55,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:03:55,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 08:03:55,502 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 08:03:55,503 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 08:03:55,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:55,510 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 08:03:55,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 08:03:55,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:55,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:55,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 08:03:55,515 INFO L87 Difference]: Start difference. First operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 42 states. [2022-04-28 08:03:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:55,518 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-28 08:03:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-04-28 08:03:55,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:55,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:55,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:03:55,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:03:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 14 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 08:03:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-04-28 08:03:55,521 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2022-04-28 08:03:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:03:55,522 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-04-28 08:03:55,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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:03:55,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 50 transitions. [2022-04-28 08:03:55,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:55,594 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-04-28 08:03:55,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:03:55,594 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:03:55,595 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:03:55,624 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:03:55,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:03:55,822 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:03:55,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:03:55,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 1 times [2022-04-28 08:03:55,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:55,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11189050] [2022-04-28 08:03:55,823 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:03:55,823 INFO L85 PathProgramCache]: Analyzing trace with hash 2087529154, now seen corresponding path program 2 times [2022-04-28 08:03:55,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:03:55,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291721127] [2022-04-28 08:03:55,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:03:55,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:03:55,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:03:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877756224] [2022-04-28 08:03:55,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 08:03:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:03:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:03:55,838 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:03:55,840 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:03:55,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 08:03:55,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 08:03:55,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 08:03:55,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:03:55,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:03:56,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2022-04-28 08:03:56,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#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); {833#true} is VALID [2022-04-28 08:03:56,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:03:56,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #69#return; {833#true} is VALID [2022-04-28 08:03:56,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret5 := main(); {833#true} is VALID [2022-04-28 08:03:56,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {833#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; {833#true} is VALID [2022-04-28 08:03:56,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {833#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {833#true} is VALID [2022-04-28 08:03:56,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 08:03:56,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 08:03:56,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:03:56,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {833#true} {833#true} #55#return; {833#true} is VALID [2022-04-28 08:03:56,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {833#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:03:56,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:03:56,019 INFO L272 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {833#true} is VALID [2022-04-28 08:03:56,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 08:03:56,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 08:03:56,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:03:56,020 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #57#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:03:56,020 INFO L272 TraceCheckUtils]: 18: Hoare triple {871#(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)); {833#true} is VALID [2022-04-28 08:03:56,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {833#true} ~cond := #in~cond; {833#true} is VALID [2022-04-28 08:03:56,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {833#true} assume !(0 == ~cond); {833#true} is VALID [2022-04-28 08:03:56,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {833#true} assume true; {833#true} is VALID [2022-04-28 08:03:56,022 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {833#true} {871#(and (= main_~t~0 1) (= main_~s~0 1))} #59#return; {871#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-28 08:03:56,023 INFO L272 TraceCheckUtils]: 23: Hoare triple {871#(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)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:03:56,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:03:56,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {834#false} is VALID [2022-04-28 08:03:56,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {834#false} assume !false; {834#false} is VALID [2022-04-28 08:03:56,024 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:03:56,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:03:56,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:03:56,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291721127] [2022-04-28 08:03:56,025 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:03:56,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877756224] [2022-04-28 08:03:56,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877756224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:56,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:56,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:03:56,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:03:56,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11189050] [2022-04-28 08:03:56,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11189050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:03:56,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:03:56,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 08:03:56,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439956251] [2022-04-28 08:03:56,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:03:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 08:03:56,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:03:56,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:03:56,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:56,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 08:03:56,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:56,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 08:03:56,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:03:56,048 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:03:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:56,212 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-04-28 08:03:56,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 08:03:56,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-28 08:03:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:03:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:03:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:03:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:03:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-28 08:03:56,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-28 08:03:56,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:56,259 INFO L225 Difference]: With dead ends: 48 [2022-04-28 08:03:56,259 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 08:03:56,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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:03:56,260 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:03:56,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:03:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 08:03:56,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 08:03:56,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:03:56,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:03:56,276 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:03:56,277 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:03:56,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:56,279 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 08:03:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 08:03:56,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:56,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:56,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 08:03:56,281 INFO L87 Difference]: Start difference. First operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-28 08:03:56,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:03:56,283 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-28 08:03:56,283 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 08:03:56,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:03:56,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:03:56,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:03:56,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:03:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 08:03:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-04-28 08:03:56,285 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 27 [2022-04-28 08:03:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:03:56,286 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-04-28 08:03:56,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 08:03:56,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 48 transitions. [2022-04-28 08:03:56,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:03:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-04-28 08:03:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 08:03:56,337 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:03:56,337 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:03:56,364 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:03:56,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-28 08:03:56,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:03:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:03:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2092280728, now seen corresponding path program 1 times [2022-04-28 08:03:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:03:56,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1468812124] [2022-04-28 08:04:00,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 08:04:00,780 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 08:04:00,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1589942244, now seen corresponding path program 1 times [2022-04-28 08:04:00,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:04:00,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044392690] [2022-04-28 08:04:00,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:04:00,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:04:00,800 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 08:04:00,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [788352012] [2022-04-28 08:04:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:04:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:04:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:04:00,807 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:04:00,838 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:04:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:04:00,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 08:04:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:04:00,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 08:04:11,318 INFO L272 TraceCheckUtils]: 0: Hoare triple {1188#true} call ULTIMATE.init(); {1188#true} is VALID [2022-04-28 08:04:11,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {1188#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); {1188#true} is VALID [2022-04-28 08:04:11,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 08:04:11,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1188#true} {1188#true} #69#return; {1188#true} is VALID [2022-04-28 08:04:11,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {1188#true} call #t~ret5 := main(); {1188#true} is VALID [2022-04-28 08:04:11,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {1188#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; {1188#true} is VALID [2022-04-28 08:04:11,319 INFO L272 TraceCheckUtils]: 6: Hoare triple {1188#true} call assume_abort_if_not((if ~n~0 >= 0 && ~n~0 <= 50 then 1 else 0)); {1188#true} is VALID [2022-04-28 08:04:11,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {1188#true} ~cond := #in~cond; {1188#true} is VALID [2022-04-28 08:04:11,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {1188#true} assume !(0 == ~cond); {1188#true} is VALID [2022-04-28 08:04:11,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {1188#true} assume true; {1188#true} is VALID [2022-04-28 08:04:11,320 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1188#true} {1188#true} #55#return; {1188#true} is VALID [2022-04-28 08:04:11,322 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#true} ~a~0 := 0;~s~0 := 1;~t~0 := 1; {1226#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-28 08:04:11,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {1226#(and (= main_~a~0 0) (= main_~t~0 1))} [73] L30-2-->L31_primed: Formula: (let ((.cse5 (= v_main_~t~0_18 v_main_~t~0_17)) (.cse6 (= v_main_~s~0_19 v_main_~s~0_18)) (.cse7 (= v_main_~a~0_18 v_main_~a~0_17)) (.cse0 (<= v_main_~s~0_19 v_main_~n~0_8)) (.cse8 (= (* v_main_~s~0_19 4) (+ (* v_main_~t~0_18 2) (* v_main_~t~0_18 v_main_~t~0_18) 1))) (.cse3 (= v_main_~t~0_18 (+ (* 2 v_main_~a~0_18) 1))) (.cse4 (* (- 1) v_main_~a~0_18))) (or (let ((.cse1 (div (+ .cse4 v_main_~a~0_17) 2))) (and .cse0 (< 0 .cse1) (= v_main_~t~0_17 (+ v_main_~t~0_18 (* .cse1 4))) (forall ((v_itHalf_1 Int)) (or (let ((.cse2 (* (* v_main_~t~0_18 v_itHalf_1) 2))) (and (<= (+ v_main_~s~0_19 v_main_~t~0_18 .cse2 2 (* v_itHalf_1 6) (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_8) (= (+ v_main_~s~0_19 v_main_~t~0_18 .cse2) (+ 2 (* (* v_itHalf_1 v_main_~a~0_18) 4) (* v_itHalf_1 2) (* 4 v_main_~a~0_18) (* v_main_~a~0_18 v_main_~a~0_18))))) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~a~0_18) v_main_~a~0_17) 2))) (not (<= 0 v_itHalf_1)))) (= v_main_~s~0_18 (+ (* .cse1 2) v_main_~s~0_19 (* 4 (* .cse1 .cse1)) (* (* v_main_~t~0_18 .cse1) 2))) .cse3 (= (mod (+ v_main_~a~0_18 v_main_~a~0_17) 2) 0))) (and .cse5 .cse6 .cse7 (= v_main_~n~0_8 v_main_~n~0_8)) (and (or (not .cse0) (not .cse3) (not .cse8)) .cse5 .cse6 .cse7) (let ((.cse9 (div (+ (- 1) .cse4 v_main_~a~0_17) 2))) (and .cse0 (= (+ v_main_~s~0_19 v_main_~t~0_18 2 (* 6 .cse9) (* (* v_main_~t~0_18 .cse9) 2) (* (* .cse9 .cse9) 4)) v_main_~s~0_18) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) (* (- 1) v_main_~a~0_18) v_main_~a~0_17) 2))) (not (<= 1 v_itHalf_1)) (let ((.cse11 (* (* v_main_~t~0_18 v_itHalf_1) 2)) (.cse10 (* v_itHalf_1 2))) (and (= (+ (* 2 v_main_~a~0_18) (* (* v_itHalf_1 v_main_~a~0_18) 4) .cse10 (* v_main_~a~0_18 v_main_~a~0_18) 1) (+ v_main_~s~0_19 .cse11)) (<= (+ v_main_~s~0_19 .cse11 .cse10 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_8))))) (<= 0 .cse9) (= v_main_~t~0_17 (+ v_main_~t~0_18 (* .cse9 4) 2)) (= (mod (+ 1 v_main_~a~0_18 v_main_~a~0_17) 2) 0) .cse8 .cse3)))) InVars {main_~t~0=v_main_~t~0_18, main_~n~0=v_main_~n~0_8, main_~s~0=v_main_~s~0_19, main_~a~0=v_main_~a~0_18} OutVars{main_~t~0=v_main_~t~0_17, main_~n~0=v_main_~n~0_8, main_~s~0=v_main_~s~0_18, main_~a~0=v_main_~a~0_17} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} is VALID [2022-04-28 08:04:12,191 WARN L290 TraceCheckUtils]: 13: Hoare triple {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} [72] L31_primed-->L31: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} is UNKNOWN [2022-04-28 08:04:12,193 INFO L272 TraceCheckUtils]: 14: Hoare triple {1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1237#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 08:04:12,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1237#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1241#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 08:04:12,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {1241#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1189#false} is VALID [2022-04-28 08:04:12,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#false} assume !false; {1189#false} is VALID [2022-04-28 08:04:12,200 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:04:12,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 08:04:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:04:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044392690] [2022-04-28 08:04:12,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 08:04:12,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788352012] [2022-04-28 08:04:12,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788352012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:04:12,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:04:12,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 08:04:57,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:04:57,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1468812124] [2022-04-28 08:04:57,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1468812124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:04:57,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:04:57,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 08:04:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163726647] [2022-04-28 08:04:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:04:57,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 34 [2022-04-28 08:04:57,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:04:57,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 11 states have internal predecessors, (22), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 08:04:57,725 WARN L143 InductivityCheck]: Transition 1259#(and (<= main_~s~0 (+ main_~n~0 main_~t~0)) (= (+ (* main_~s~0 4) (* main_~t~0 (- 4))) (+ (- 3) (* main_~t~0 2) (* (+ (- 2) main_~t~0) (+ (- 2) main_~t~0))))) ( _ , assume !false; , 1230#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= main_~t~0 (+ (* (div (+ (- 1) main_~a~0) 2) 4) 3)) (<= 0 (div (+ (- 1) main_~a~0) 2)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (- 1) main_~a~0) 2))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))) (= (mod (+ main_~a~0 1) 2) 0))) ) not inductive [2022-04-28 08:04:57,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 08:04:57,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 08:04:57,926 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:564) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:437) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 08:04:57,931 INFO L158 Benchmark]: Toolchain (without parser) took 65275.63ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 127.5MB in the beginning and 79.8MB in the end (delta: 47.8MB). Peak memory consumption was 83.9MB. Max. memory is 8.0GB. [2022-04-28 08:04:57,932 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:04:57,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.64ms. Allocated memory is still 174.1MB. Free memory was 127.3MB in the beginning and 152.7MB in the end (delta: -25.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-28 08:04:57,932 INFO L158 Benchmark]: Boogie Preprocessor took 39.08ms. Allocated memory is still 174.1MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 08:04:57,932 INFO L158 Benchmark]: RCFGBuilder took 325.15ms. Allocated memory is still 174.1MB. Free memory was 151.1MB in the beginning and 140.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 08:04:57,932 INFO L158 Benchmark]: TraceAbstraction took 64679.17ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 140.1MB in the beginning and 79.8MB in the end (delta: 60.3MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. [2022-04-28 08:04:57,933 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.64ms. Allocated memory is still 174.1MB. Free memory was 127.3MB in the beginning and 152.7MB in the end (delta: -25.3MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.08ms. Allocated memory is still 174.1MB. Free memory was 152.7MB in the beginning and 151.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 325.15ms. Allocated memory is still 174.1MB. Free memory was 151.1MB in the beginning and 140.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 64679.17ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 140.1MB in the beginning and 79.8MB in the end (delta: 60.3MB). Peak memory consumption was 96.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 08:04:58,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...