/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 14:35:07,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 14:35:07,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 14:35:07,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 14:35:07,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 14:35:07,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 14:35:07,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 14:35:07,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 14:35:07,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 14:35:07,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 14:35:07,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 14:35:07,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 14:35:07,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 14:35:07,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 14:35:07,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 14:35:07,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 14:35:07,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 14:35:07,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 14:35:07,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 14:35:07,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 14:35:07,933 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 14:35:07,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 14:35:07,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 14:35:07,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 14:35:07,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 14:35:07,940 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 14:35:07,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 14:35:07,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 14:35:07,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 14:35:07,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 14:35:07,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 14:35:07,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 14:35:07,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 14:35:07,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 14:35:07,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 14:35:07,958 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 14:35:07,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 14:35:07,959 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 14:35:07,959 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 14:35:07,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 14:35:07,960 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 14:35:07,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 14:35:07,961 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 14:35:07,966 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 14:35:07,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 14:35:07,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 14:35:07,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 14:35:07,970 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 14:35:07,970 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 14:35:07,970 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 14:35:07,970 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 14:35:07,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 14:35:07,971 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 14:35:07,971 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 14:35:07,971 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 14:35:07,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:35:07,972 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 14:35:07,972 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 14:35:08,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 14:35:08,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 14:35:08,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 14:35:08,204 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 14:35:08,215 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 14:35:08,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-08 14:35:08,261 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4b2b3f6/99f5a095453345c6b5c279f79d85c336/FLAG360de3122 [2022-04-08 14:35:08,671 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 14:35:08,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps6-ll_valuebound10.c [2022-04-08 14:35:08,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4b2b3f6/99f5a095453345c6b5c279f79d85c336/FLAG360de3122 [2022-04-08 14:35:09,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4b2b3f6/99f5a095453345c6b5c279f79d85c336 [2022-04-08 14:35:09,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 14:35:09,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 14:35:09,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 14:35:09,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 14:35:09,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 14:35:09,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@715704c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09, skipping insertion in model container [2022-04-08 14:35:09,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 14:35:09,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 14:35:09,314 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/ps6-ll_valuebound10.c[458,471] [2022-04-08 14:35:09,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:35:09,356 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 14:35:09,372 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/ps6-ll_valuebound10.c[458,471] [2022-04-08 14:35:09,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 14:35:09,406 INFO L208 MainTranslator]: Completed translation [2022-04-08 14:35:09,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09 WrapperNode [2022-04-08 14:35:09,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 14:35:09,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 14:35:09,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 14:35:09,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 14:35:09,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,457 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 14:35:09,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 14:35:09,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 14:35:09,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 14:35:09,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (1/1) ... [2022-04-08 14:35:09,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 14:35:09,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:35:09,522 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 14:35:09,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 14:35:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 14:35:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 14:35:09,642 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 14:35:09,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 14:35:09,643 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 14:35:09,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 14:35:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 14:35:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 14:35:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 14:35:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 14:35:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_short [2022-04-08 14:35:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 14:35:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 14:35:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 14:35:09,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 14:35:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 14:35:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 14:35:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 14:35:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 14:35:09,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 14:35:09,704 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 14:35:09,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 14:35:09,873 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 14:35:09,877 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 14:35:09,878 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 14:35:09,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:35:09 BoogieIcfgContainer [2022-04-08 14:35:09,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 14:35:09,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 14:35:09,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 14:35:09,883 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 14:35:09,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 02:35:09" (1/3) ... [2022-04-08 14:35:09,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa00522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:35:09, skipping insertion in model container [2022-04-08 14:35:09,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 02:35:09" (2/3) ... [2022-04-08 14:35:09,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa00522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 02:35:09, skipping insertion in model container [2022-04-08 14:35:09,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 02:35:09" (3/3) ... [2022-04-08 14:35:09,885 INFO L111 eAbstractionObserver]: Analyzing ICFG ps6-ll_valuebound10.c [2022-04-08 14:35:09,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 14:35:09,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 14:35:09,957 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 14:35:09,962 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 14:35:09,963 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 14:35:09,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:35:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:35:09,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:35:09,983 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:35:09,983 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:35:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:35:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 1 times [2022-04-08 14:35:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:09,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633679188] [2022-04-08 14:35:10,002 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:35:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1098891495, now seen corresponding path program 2 times [2022-04-08 14:35:10,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:35:10,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357324651] [2022-04-08 14:35:10,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:35:10,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:35:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:10,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 14:35:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:10,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 14:35:10,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:35:10,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:35:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 14:35:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:10,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:35:10,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:35:10,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:35:10,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:35:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 14:35:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:10,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:35:10,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:35:10,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:35:10,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:35:10,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 14:35:10,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 14:35:10,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 14:35:10,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2022-04-08 14:35:10,136 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-08 14:35:10,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {32#true} is VALID [2022-04-08 14:35:10,136 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {32#true} is VALID [2022-04-08 14:35:10,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:35:10,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:35:10,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:35:10,137 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #53#return; {33#false} is VALID [2022-04-08 14:35:10,137 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {32#true} is VALID [2022-04-08 14:35:10,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 14:35:10,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 14:35:10,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 14:35:10,138 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #55#return; {33#false} is VALID [2022-04-08 14:35:10,138 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {33#false} is VALID [2022-04-08 14:35:10,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-08 14:35:10,139 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {33#false} is VALID [2022-04-08 14:35:10,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 14:35:10,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 14:35:10,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 14:35:10,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:35:10,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:35:10,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357324651] [2022-04-08 14:35:10,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357324651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:10,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:10,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:35:10,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:35:10,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633679188] [2022-04-08 14:35:10,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633679188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:10,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:10,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 14:35:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288470212] [2022-04-08 14:35:10,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:35:10,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:35:10,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:35:10,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:35:10,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:10,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 14:35:10,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:10,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 14:35:10,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:35:10,184 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:35:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:10,342 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-08 14:35:10,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 14:35:10,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 14:35:10,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:35:10,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:35:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:35:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:35:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-04-08 14:35:10,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2022-04-08 14:35:10,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:10,460 INFO L225 Difference]: With dead ends: 51 [2022-04-08 14:35:10,460 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 14:35:10,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 14:35:10,469 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:35:10,470 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:35:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 14:35:10,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 14:35:10,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:35:10,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:35:10,503 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:35:10,504 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:35:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:10,514 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:35:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:35:10,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:10,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:10,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:35:10,516 INFO L87 Difference]: Start difference. First operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 24 states. [2022-04-08 14:35:10,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:10,518 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 14:35:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:35:10,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:10,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:10,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:35:10,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:35:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:35:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 14:35:10,523 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 14:35:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:35:10,523 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 14:35:10,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 14:35:10,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 14:35:10,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:10,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 14:35:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 14:35:10,555 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:35:10,556 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:35:10,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 14:35:10,556 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:35:10,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:35:10,558 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 1 times [2022-04-08 14:35:10,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:10,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1905471067] [2022-04-08 14:35:10,562 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:35:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 769620075, now seen corresponding path program 2 times [2022-04-08 14:35:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:35:10,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815903518] [2022-04-08 14:35:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:35:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:35:10,592 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:35:10,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374302600] [2022-04-08 14:35:10,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:35:10,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:10,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:35:10,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:35:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 14:35:10,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 14:35:10,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:35:10,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 14:35:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:10,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:35:10,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 14:35:10,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-08 14:35:10,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:35:10,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #63#return; {246#true} is VALID [2022-04-08 14:35:10,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret5 := main(); {246#true} is VALID [2022-04-08 14:35:10,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {246#true} is VALID [2022-04-08 14:35:10,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {246#true} is VALID [2022-04-08 14:35:10,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:35:10,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:35:10,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:35:10,782 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #53#return; {246#true} is VALID [2022-04-08 14:35:10,783 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {246#true} is VALID [2022-04-08 14:35:10,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 14:35:10,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 14:35:10,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 14:35:10,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #55#return; {246#true} is VALID [2022-04-08 14:35:10,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:10,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {299#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:10,785 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:35:10,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:35:10,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 14:35:10,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 14:35:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:35:10,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:35:10,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:35:10,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815903518] [2022-04-08 14:35:10,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:35:10,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374302600] [2022-04-08 14:35:10,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374302600] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:10,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:10,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:35:10,788 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:35:10,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1905471067] [2022-04-08 14:35:10,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1905471067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:10,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:10,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:35:10,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794396566] [2022-04-08 14:35:10,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:35:10,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:35:10,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:35:10,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:35:10,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:10,803 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:35:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:10,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:35:10,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 14:35:10,804 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:35:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:10,926 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 14:35:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:35:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 14:35:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:35:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:35:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:35:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:35:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 14:35:10,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 14:35:10,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:10,969 INFO L225 Difference]: With dead ends: 35 [2022-04-08 14:35:10,970 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 14:35:10,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:35:10,971 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:35:10,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 85 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:35:10,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 14:35:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-08 14:35:10,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:35:10,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:10,980 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:10,981 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:10,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:10,982 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:35:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:35:10,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:10,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:10,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 14:35:10,983 INFO L87 Difference]: Start difference. First operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 31 states. [2022-04-08 14:35:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:10,985 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-08 14:35:10,985 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:35:10,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:10,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:10,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:35:10,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:35:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2022-04-08 14:35:10,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2022-04-08 14:35:10,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:35:10,988 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2022-04-08 14:35:10,988 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 14:35:10,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 34 transitions. [2022-04-08 14:35:11,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:11,025 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2022-04-08 14:35:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 14:35:11,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:35:11,026 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:35:11,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 14:35:11,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:11,240 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:35:11,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:35:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 1 times [2022-04-08 14:35:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:11,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591551782] [2022-04-08 14:35:11,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:35:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 645812411, now seen corresponding path program 2 times [2022-04-08 14:35:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:35:11,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76232328] [2022-04-08 14:35:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:35:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:35:11,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:35:11,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [70999224] [2022-04-08 14:35:11,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:35:11,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:11,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:35:11,256 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:35:11,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 14:35:11,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:35:11,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:35:11,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:35:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:11,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:35:11,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:35:11,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-08 14:35:11,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:35:11,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:35:11,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-08 14:35:11,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-08 14:35:11,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:35:11,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:35:11,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:35:11,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:35:11,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:35:11,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:35:11,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,459 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:35:11,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:11,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:11,460 INFO L272 TraceCheckUtils]: 18: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:35:11,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:35:11,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:35:11,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,461 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {565#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {565#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:11,462 INFO L290 TraceCheckUtils]: 23: Hoare triple {565#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 14:35:11,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} assume !false; {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} is VALID [2022-04-08 14:35:11,464 INFO L272 TraceCheckUtils]: 25: Hoare triple {587#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 (* main_~y~0 (* (* main_~y~0 (* main_~y~0 main_~y~0)) main_~y~0))))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:35:11,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:35:11,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:35:11,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:35:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:35:11,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:35:11,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-04-08 14:35:11,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {598#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {513#false} is VALID [2022-04-08 14:35:11,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {594#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {598#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:35:11,706 INFO L272 TraceCheckUtils]: 25: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {594#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:35:11,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:35:11,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:35:11,751 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {512#true} {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} #57#return; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:35:11,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:35:11,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:35:11,751 INFO L272 TraceCheckUtils]: 18: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {512#true} is VALID [2022-04-08 14:35:11,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} assume !false; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:35:11,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {614#(= (+ (* 2 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 6 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0 main_~y~0)) (* 5 (* main_~y~0 main_~y~0 main_~y~0 main_~y~0))) (+ (* main_~x~0 12) (* main_~y~0 main_~y~0)))} is VALID [2022-04-08 14:35:11,754 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {512#true} {512#true} #55#return; {512#true} is VALID [2022-04-08 14:35:11,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:35:11,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:35:11,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {512#true} is VALID [2022-04-08 14:35:11,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {512#true} {512#true} #53#return; {512#true} is VALID [2022-04-08 14:35:11,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#true} assume !(0 == ~cond); {512#true} is VALID [2022-04-08 14:35:11,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#true} ~cond := #in~cond; {512#true} is VALID [2022-04-08 14:35:11,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {512#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {512#true} is VALID [2022-04-08 14:35:11,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {512#true} is VALID [2022-04-08 14:35:11,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2022-04-08 14:35:11,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #63#return; {512#true} is VALID [2022-04-08 14:35:11,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2022-04-08 14:35:11,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#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(9, 2);call #Ultimate.allocInit(12, 3); {512#true} is VALID [2022-04-08 14:35:11,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2022-04-08 14:35:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 14:35:11,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:35:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76232328] [2022-04-08 14:35:11,756 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:35:11,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70999224] [2022-04-08 14:35:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70999224] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:35:11,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:35:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 14:35:11,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:35:11,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591551782] [2022-04-08 14:35:11,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591551782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:11,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:11,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:35:11,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377214351] [2022-04-08 14:35:11,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:35:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 29 [2022-04-08 14:35:11,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:35:11,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 14:35:11,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:11,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:35:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:11,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:35:11,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:35:11,861 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 14:35:11,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:11,975 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 14:35:11,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:35:11,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 29 [2022-04-08 14:35:11,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:35:11,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 14:35:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:35:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 14:35:11,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-08 14:35:11,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-08 14:35:12,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:12,054 INFO L225 Difference]: With dead ends: 37 [2022-04-08 14:35:12,054 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 14:35:12,054 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 14:35:12,055 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:35:12,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 75 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:35:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 14:35:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 14:35:12,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:35:12,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:12,067 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:12,067 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:12,069 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:35:12,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:35:12,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:12,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:12,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 14:35:12,070 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 33 states. [2022-04-08 14:35:12,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:12,071 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 14:35:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:35:12,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:12,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:12,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:35:12,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:35:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:35:12,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 14:35:12,073 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-08 14:35:12,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:35:12,073 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 14:35:12,073 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-08 14:35:12,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 14:35:12,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 14:35:12,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:35:12,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:35:12,155 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:35:12,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 14:35:12,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 14:35:12,356 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:35:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:35:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 1 times [2022-04-08 14:35:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:12,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [359493230] [2022-04-08 14:35:12,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:35:12,357 INFO L85 PathProgramCache]: Analyzing trace with hash 463554397, now seen corresponding path program 2 times [2022-04-08 14:35:12,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:35:12,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915288385] [2022-04-08 14:35:12,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:35:12,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:35:12,380 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:35:12,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1725940866] [2022-04-08 14:35:12,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:35:12,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:12,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:35:12,382 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-08 14:35:12,383 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-08 14:35:12,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:35:12,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:35:12,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-08 14:35:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:12,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:35:12,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 14:35:12,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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(9, 2);call #Ultimate.allocInit(12, 3); {900#true} is VALID [2022-04-08 14:35:12,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:35:12,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {900#true} {900#true} #63#return; {900#true} is VALID [2022-04-08 14:35:12,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {900#true} call #t~ret5 := main(); {900#true} is VALID [2022-04-08 14:35:12,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {900#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {900#true} is VALID [2022-04-08 14:35:12,743 INFO L272 TraceCheckUtils]: 6: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {900#true} is VALID [2022-04-08 14:35:12,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:35:12,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:35:12,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:35:12,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {900#true} #53#return; {900#true} is VALID [2022-04-08 14:35:12,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {900#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {900#true} is VALID [2022-04-08 14:35:12,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:35:12,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:35:12,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:35:12,745 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {900#true} #55#return; {900#true} is VALID [2022-04-08 14:35:12,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {900#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:12,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:12,746 INFO L272 TraceCheckUtils]: 18: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:35:12,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:35:12,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:35:12,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:35:12,747 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {900#true} {953#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {953#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:12,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:35:12,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !false; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:35:12,748 INFO L272 TraceCheckUtils]: 25: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:35:12,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:35:12,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:35:12,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:35:12,749 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {900#true} {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} #57#return; {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} is VALID [2022-04-08 14:35:12,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {975#(and (= (+ (- 1) main_~y~0) 0) (< 0 main_~k~0) (<= main_~c~0 1))} assume !(~c~0 < ~k~0); {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:35:12,750 INFO L272 TraceCheckUtils]: 31: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {900#true} is VALID [2022-04-08 14:35:12,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 14:35:12,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 14:35:12,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 14:35:12,751 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {900#true} {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} #59#return; {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} is VALID [2022-04-08 14:35:12,752 INFO L272 TraceCheckUtils]: 36: Hoare triple {997#(and (= (+ (- 1) main_~y~0) 0) (<= main_~k~0 1) (< 0 main_~k~0))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:35:12,752 INFO L290 TraceCheckUtils]: 37: Hoare triple {1016#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1020#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:35:12,752 INFO L290 TraceCheckUtils]: 38: Hoare triple {1020#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {901#false} is VALID [2022-04-08 14:35:12,753 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 14:35:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 14:35:12,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:35:13,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:35:13,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915288385] [2022-04-08 14:35:13,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:35:13,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725940866] [2022-04-08 14:35:13,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725940866] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:35:13,145 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:35:13,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-04-08 14:35:13,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:35:13,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [359493230] [2022-04-08 14:35:13,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [359493230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:13,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:35:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918070322] [2022-04-08 14:35:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:35:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:35:13,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:35:13,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:35:13,177 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-08 14:35:13,177 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:35:13,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:13,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:35:13,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:35:13,178 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:35:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:13,397 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-08 14:35:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 14:35:13,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-04-08 14:35:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:35:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:35:13,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:35:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:35:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-08 14:35:13,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-08 14:35:13,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:13,434 INFO L225 Difference]: With dead ends: 42 [2022-04-08 14:35:13,434 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 14:35:13,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:35:13,435 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:35:13,435 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:35:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 14:35:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 14:35:13,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:35:13,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:35:13,450 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:35:13,451 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:35:13,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:13,452 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:35:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:35:13,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:13,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:13,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 14:35:13,453 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 14:35:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:13,454 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 14:35:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:35:13,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:13,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:13,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:35:13,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:35:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:35:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-04-08 14:35:13,456 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 40 [2022-04-08 14:35:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:35:13,457 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-04-08 14:35:13,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-08 14:35:13,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 39 transitions. [2022-04-08 14:35:13,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:13,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-04-08 14:35:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-08 14:35:13,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:35:13,637 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:35:13,663 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-08 14:35:13,837 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:13,838 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:35:13,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:35:13,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 3 times [2022-04-08 14:35:13,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:13,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005082953] [2022-04-08 14:35:13,839 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:35:13,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1886956461, now seen corresponding path program 4 times [2022-04-08 14:35:13,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:35:13,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548446373] [2022-04-08 14:35:13,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:35:13,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:35:13,855 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:35:13,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188472966] [2022-04-08 14:35:13,855 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:35:13,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:13,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:35:13,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:35:13,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 14:35:13,942 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:35:13,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:35:13,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:35:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:35:13,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:35:14,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1315#true} is VALID [2022-04-08 14:35:14,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#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(9, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-08 14:35:14,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #63#return; {1315#true} is VALID [2022-04-08 14:35:14,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret5 := main(); {1315#true} is VALID [2022-04-08 14:35:14,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} havoc ~k~0;havoc ~y~0;havoc ~x~0;havoc ~c~0;assume -32768 <= #t~nondet4 && #t~nondet4 <= 32767;~k~0 := #t~nondet4;havoc #t~nondet4; {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 >= 0 && ~k~0 <= 10 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1315#true} {1315#true} #53#return; {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L272 TraceCheckUtils]: 11: Hoare triple {1315#true} call assume_abort_if_not((if ~k~0 <= 256 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:35:14,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,297 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1315#true} {1315#true} #55#return; {1315#true} is VALID [2022-04-08 14:35:14,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1315#true} ~y~0 := 0;~x~0 := 0;~c~0 := 0; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:14,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !false; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:14,298 INFO L272 TraceCheckUtils]: 18: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:35:14,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:35:14,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:35:14,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,308 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1315#true} {1368#(and (= main_~c~0 0) (= main_~y~0 0))} #57#return; {1368#(and (= main_~c~0 0) (= main_~y~0 0))} is VALID [2022-04-08 14:35:14,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {1368#(and (= main_~c~0 0) (= main_~y~0 0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:35:14,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !false; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:35:14,309 INFO L272 TraceCheckUtils]: 25: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:35:14,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:35:14,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:35:14,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,310 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1315#true} {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} #57#return; {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} is VALID [2022-04-08 14:35:14,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(and (= main_~y~0 1) (< 0 main_~k~0) (= main_~c~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~y~0 := 1 + ~y~0;~x~0 := ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~x~0; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:35:14,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !false; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:35:14,311 INFO L272 TraceCheckUtils]: 32: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:35:14,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:35:14,311 INFO L290 TraceCheckUtils]: 34: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:35:14,311 INFO L290 TraceCheckUtils]: 35: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,312 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1315#true} {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} #57#return; {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} is VALID [2022-04-08 14:35:14,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {1412#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~c~0 2))} assume !(~c~0 < ~k~0); {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:35:14,312 INFO L272 TraceCheckUtils]: 38: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if 0 == -2 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 6 * ~y~0 * ~y~0 * ~y~0 * ~y~0 * ~y~0 - 5 * ~y~0 * ~y~0 * ~y~0 * ~y~0 + ~y~0 * ~y~0 + 12 * ~x~0 then 1 else 0)); {1315#true} is VALID [2022-04-08 14:35:14,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {1315#true} ~cond := #in~cond; {1315#true} is VALID [2022-04-08 14:35:14,312 INFO L290 TraceCheckUtils]: 40: Hoare triple {1315#true} assume !(0 == ~cond); {1315#true} is VALID [2022-04-08 14:35:14,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-08 14:35:14,313 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1315#true} {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} #59#return; {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} is VALID [2022-04-08 14:35:14,314 INFO L272 TraceCheckUtils]: 43: Hoare triple {1434#(and (= main_~y~0 2) (< 1 main_~k~0) (<= main_~k~0 2))} call __VERIFIER_assert((if ~k~0 * ~y~0 == ~y~0 * ~y~0 then 1 else 0)); {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:35:14,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {1453#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1457#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:35:14,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {1457#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1316#false} is VALID [2022-04-08 14:35:14,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-08 14:35:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 14:35:14,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:35:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:35:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548446373] [2022-04-08 14:35:14,668 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:35:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188472966] [2022-04-08 14:35:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188472966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 14:35:14,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:35:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2022-04-08 14:35:14,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:35:14,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005082953] [2022-04-08 14:35:14,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005082953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:35:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:35:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:35:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957672983] [2022-04-08 14:35:14,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:35:14,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:35:14,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:35:14,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:35:14,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:14,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:35:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:14,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:35:14,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:35:14,697 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:35:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:14,966 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-04-08 14:35:14,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:35:14,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 47 [2022-04-08 14:35:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:35:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:35:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:35:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:35:14,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-08 14:35:14,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-08 14:35:15,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:15,006 INFO L225 Difference]: With dead ends: 45 [2022-04-08 14:35:15,006 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 14:35:15,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:35:15,007 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 2 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:35:15,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:35:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 14:35:15,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-08 14:35:15,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:35:15,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:35:15,024 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:35:15,024 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:35:15,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:15,026 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:35:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:35:15,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:15,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:15,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 14:35:15,027 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 39 states. [2022-04-08 14:35:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:35:15,028 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-08 14:35:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:35:15,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:35:15,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:35:15,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:35:15,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:35:15,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 10 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:35:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2022-04-08 14:35:15,030 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 47 [2022-04-08 14:35:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:35:15,030 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2022-04-08 14:35:15,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2022-04-08 14:35:15,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 43 transitions. [2022-04-08 14:35:15,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:35:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-08 14:35:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 14:35:15,155 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:35:15,156 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:35:15,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 14:35:15,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:15,356 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:35:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:35:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 5 times [2022-04-08 14:35:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:35:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [492648404] [2022-04-08 14:35:15,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 14:35:15,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1213805219, now seen corresponding path program 6 times [2022-04-08 14:35:15,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:35:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266505229] [2022-04-08 14:35:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:35:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:35:15,368 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:35:15,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [355590607] [2022-04-08 14:35:15,368 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:35:15,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:35:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:35:15,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:35:15,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process