/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/cohencu-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:48:46,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:48:46,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:48:47,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:48:47,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:48:47,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:48:47,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:48:47,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:48:47,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:48:47,041 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:48:47,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:48:47,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:48:47,042 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:48:47,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:48:47,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:48:47,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:48:47,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:48:47,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:48:47,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:48:47,063 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:48:47,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:48:47,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:48:47,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:48:47,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:48:47,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:48:47,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:48:47,069 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:48:47,069 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:48:47,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:48:47,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:48:47,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:48:47,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:48:47,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:48:47,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:48:47,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:48:47,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:48:47,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:48:47,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:48:47,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:48:47,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:48:47,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:48:47,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:48:47,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:48:47,088 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:48:47,088 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:48:47,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:48:47,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:48:47,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:48:47,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:48:47,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:48:47,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:48:47,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:48:47,092 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:48:47,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:48:47,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:48:47,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:48:47,093 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:48:47,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:48:47,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:48:47,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:48:47,280 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:48:47,280 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:48:47,281 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-15 13:48:47,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c64efe/c0d46bebdb634c5e9e56dedfb317f921/FLAGed1fcf865 [2022-04-15 13:48:47,646 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:48:47,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_unwindbound20.c [2022-04-15 13:48:47,650 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c64efe/c0d46bebdb634c5e9e56dedfb317f921/FLAGed1fcf865 [2022-04-15 13:48:48,081 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c6c64efe/c0d46bebdb634c5e9e56dedfb317f921 [2022-04-15 13:48:48,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:48:48,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:48:48,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:48:48,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:48:48,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:48:48,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4330af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48, skipping insertion in model container [2022-04-15 13:48:48,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:48:48,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:48:48,233 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/cohencu-ll_unwindbound20.c[588,601] [2022-04-15 13:48:48,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:48:48,288 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:48:48,296 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/cohencu-ll_unwindbound20.c[588,601] [2022-04-15 13:48:48,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:48:48,314 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:48:48,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48 WrapperNode [2022-04-15 13:48:48,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:48:48,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:48:48,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:48:48,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:48:48,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,342 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:48:48,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:48:48,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:48:48,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:48:48,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (1/1) ... [2022-04-15 13:48:48,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:48:48,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:48:48,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:48:48,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:48:48,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:48:48,400 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:48:48,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:48:48,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:48:48,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:48:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:48:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:48:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:48:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:48:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:48:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:48:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:48:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:48:48,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:48:48,452 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:48:48,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:48:48,582 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:48:48,586 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:48:48,587 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:48:48,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:48:48 BoogieIcfgContainer [2022-04-15 13:48:48,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:48:48,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:48:48,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:48:48,591 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:48:48,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:48:48" (1/3) ... [2022-04-15 13:48:48,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faae27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:48:48, skipping insertion in model container [2022-04-15 13:48:48,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:48:48" (2/3) ... [2022-04-15 13:48:48,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6faae27c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:48:48, skipping insertion in model container [2022-04-15 13:48:48,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:48:48" (3/3) ... [2022-04-15 13:48:48,600 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound20.c [2022-04-15 13:48:48,603 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:48:48,603 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:48:48,645 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:48:48,649 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:48:48,649 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:48:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:48:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:48:48,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:48,667 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:48,667 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 1 times [2022-04-15 13:48:48,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:48,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310967063] [2022-04-15 13:48:48,711 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:48:48,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1839589780, now seen corresponding path program 2 times [2022-04-15 13:48:48,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:48:48,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404462230] [2022-04-15 13:48:48,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:48:48,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:48:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:48,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:48:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:48,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-15 13:48:48,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:48:48,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-15 13:48:48,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:48:48,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-15 13:48:48,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:48:48,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #81#return; {34#true} is VALID [2022-04-15 13:48:48,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-15 13:48:48,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {34#true} is VALID [2022-04-15 13:48:48,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-15 13:48:48,877 INFO L272 TraceCheckUtils]: 7: Hoare triple {35#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {35#false} is VALID [2022-04-15 13:48:48,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 13:48:48,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 13:48:48,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 13:48:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:48:48,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:48:48,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404462230] [2022-04-15 13:48:48,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404462230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:48,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:48,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:48:48,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:48:48,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310967063] [2022-04-15 13:48:48,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310967063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:48,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:48,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:48:48,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679097377] [2022-04-15 13:48:48,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:48:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:48:48,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:48:48,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:48,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:48,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:48:48,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:48:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:48:48,926 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:49,120 INFO L93 Difference]: Finished difference Result 57 states and 95 transitions. [2022-04-15 13:48:49,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:48:49,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:48:49,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:48:49,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 13:48:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-15 13:48:49,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-15 13:48:49,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:49,248 INFO L225 Difference]: With dead ends: 57 [2022-04-15 13:48:49,248 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:48:49,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:48:49,253 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:48:49,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 45 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:48:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:48:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-15 13:48:49,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:48:49,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:49,278 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:49,278 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:49,282 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-15 13:48:49,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-15 13:48:49,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:49,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:49,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-15 13:48:49,284 INFO L87 Difference]: Start difference. First operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 27 states. [2022-04-15 13:48:49,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:49,299 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2022-04-15 13:48:49,300 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2022-04-15 13:48:49,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:49,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:49,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:48:49,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:48:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2022-04-15 13:48:49,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 11 [2022-04-15 13:48:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:48:49,304 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2022-04-15 13:48:49,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:49,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 37 transitions. [2022-04-15 13:48:49,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2022-04-15 13:48:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:48:49,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:49,343 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:49,343 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:48:49,343 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:49,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:49,344 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 1 times [2022-04-15 13:48:49,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:49,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [389024743] [2022-04-15 13:48:49,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:48:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash 660459433, now seen corresponding path program 2 times [2022-04-15 13:48:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:48:49,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090294750] [2022-04-15 13:48:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:48:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:48:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:48:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:49,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:48:49,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(= ~counter~0 0)} assume true; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(= ~counter~0 0)} {262#true} #81#return; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(= ~counter~0 0)} call #t~ret6 := main(); {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(= ~counter~0 0)} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {267#(= ~counter~0 0)} is VALID [2022-04-15 13:48:49,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {268#(= |main_#t~post5| 0)} is VALID [2022-04-15 13:48:49,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#(= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {263#false} is VALID [2022-04-15 13:48:49,446 INFO L272 TraceCheckUtils]: 8: Hoare triple {263#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {263#false} is VALID [2022-04-15 13:48:49,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2022-04-15 13:48:49,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume 0 == ~cond; {263#false} is VALID [2022-04-15 13:48:49,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-15 13:48:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:48:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:48:49,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090294750] [2022-04-15 13:48:49,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090294750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:49,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:49,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:48:49,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:48:49,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [389024743] [2022-04-15 13:48:49,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [389024743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:49,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:49,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:48:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427155738] [2022-04-15 13:48:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:48:49,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:48:49,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:48:49,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:49,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:49,459 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:48:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:49,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:48:49,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:48:49,460 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:52,604 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-04-15 13:48:52,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:48:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:48:52,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:48:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:52,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-15 13:48:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-15 13:48:52,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-15 13:48:52,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:52,685 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:48:52,685 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:48:52,685 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:48:52,686 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:48:52,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:48:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:48:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 13:48:52,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:48:52,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:52,691 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:52,692 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:52,694 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 13:48:52,694 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 13:48:52,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:52,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:52,695 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-15 13:48:52,695 INFO L87 Difference]: Start difference. First operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 28 states. [2022-04-15 13:48:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:52,697 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 13:48:52,697 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 13:48:52,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:52,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:52,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:48:52,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:48:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:52,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-15 13:48:52,716 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 12 [2022-04-15 13:48:52,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:48:52,717 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-15 13:48:52,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:52,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-15 13:48:52,769 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-15 13:48:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 13:48:52,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:48:52,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:52,770 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:52,770 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:48:52,770 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 1 times [2022-04-15 13:48:52,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:52,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1748346549] [2022-04-15 13:48:52,772 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:48:52,772 INFO L85 PathProgramCache]: Analyzing trace with hash 662008565, now seen corresponding path program 2 times [2022-04-15 13:48:52,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:48:52,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674558316] [2022-04-15 13:48:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:48:52,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:48:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:48:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:52,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-15 13:48:52,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-15 13:48:52,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-15 13:48:52,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {466#true} call ULTIMATE.init(); {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:48:52,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {466#true} is VALID [2022-04-15 13:48:52,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {466#true} assume true; {466#true} is VALID [2022-04-15 13:48:52,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466#true} {466#true} #81#return; {466#true} is VALID [2022-04-15 13:48:52,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {466#true} call #t~ret6 := main(); {466#true} is VALID [2022-04-15 13:48:52,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {466#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:48:52,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:48:52,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !!(#t~post5 < 20);havoc #t~post5; {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 13:48:52,912 INFO L272 TraceCheckUtils]: 8: Hoare triple {471#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:48:52,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:48:52,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {467#false} is VALID [2022-04-15 13:48:52,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#false} assume !false; {467#false} is VALID [2022-04-15 13:48:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:48:52,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:48:52,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674558316] [2022-04-15 13:48:52,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674558316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:52,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:52,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:48:52,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:48:52,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1748346549] [2022-04-15 13:48:52,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1748346549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:52,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:52,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:48:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580112757] [2022-04-15 13:48:52,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:48:52,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:48:52,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:48:52,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:52,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:52,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:48:52,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:52,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:48:52,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:48:52,929 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:53,250 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-15 13:48:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:48:53,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:48:53,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:48:53,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:48:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-15 13:48:53,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-15 13:48:53,295 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-15 13:48:53,296 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:48:53,296 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:48:53,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:48:53,297 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:48:53,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 51 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:48:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:48:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 13:48:53,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:48:53,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:53,303 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:53,304 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:53,305 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 13:48:53,305 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:48:53,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:53,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:53,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 13:48:53,307 INFO L87 Difference]: Start difference. First operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 32 states. [2022-04-15 13:48:53,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:53,308 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-15 13:48:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:48:53,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:53,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:53,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:48:53,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:48:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 13:48:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 13:48:53,311 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2022-04-15 13:48:53,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:48:53,311 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 13:48:53,311 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:48:53,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 13:48:53,348 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-15 13:48:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 13:48:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:48:53,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:53,349 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:53,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:48:53,349 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 1 times [2022-04-15 13:48:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:53,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1011832283] [2022-04-15 13:48:53,350 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:48:53,350 INFO L85 PathProgramCache]: Analyzing trace with hash 2023221563, now seen corresponding path program 2 times [2022-04-15 13:48:53,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:48:53,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209668120] [2022-04-15 13:48:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:48:53,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:48:53,377 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:48:53,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [867189047] [2022-04-15 13:48:53,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:48:53,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:48:53,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:48:53,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:48:53,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:48:53,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:48:53,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:48:53,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:48:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:53,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:48:53,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2022-04-15 13:48:53,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {681#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {681#true} is VALID [2022-04-15 13:48:53,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-15 13:48:53,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #81#return; {681#true} is VALID [2022-04-15 13:48:53,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2022-04-15 13:48:53,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {681#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:48:53,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:48:53,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:48:53,580 INFO L272 TraceCheckUtils]: 8: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {681#true} is VALID [2022-04-15 13:48:53,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {681#true} ~cond := #in~cond; {681#true} is VALID [2022-04-15 13:48:53,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(0 == ~cond); {681#true} is VALID [2022-04-15 13:48:53,580 INFO L290 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2022-04-15 13:48:53,582 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {681#true} {701#(and (= main_~n~0 0) (= main_~y~0 1))} #59#return; {701#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 13:48:53,583 INFO L272 TraceCheckUtils]: 13: Hoare triple {701#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {726#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:48:53,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {730#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:48:53,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {730#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {682#false} is VALID [2022-04-15 13:48:53,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {682#false} assume !false; {682#false} is VALID [2022-04-15 13:48:53,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:48:53,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:48:53,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:48:53,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209668120] [2022-04-15 13:48:53,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:48:53,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867189047] [2022-04-15 13:48:53,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867189047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:53,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:53,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:48:53,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:48:53,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1011832283] [2022-04-15 13:48:53,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1011832283] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:53,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:53,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:48:53,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741503980] [2022-04-15 13:48:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:48:53,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 13:48:53,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:48:53,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:48:53,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:53,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:48:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:48:53,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:48:53,602 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:48:56,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:56,188 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-04-15 13:48:56,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:48:56,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-15 13:48:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:48:56,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:48:56,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:48:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:48:56,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:48:56,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 13:48:56,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:56,250 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:48:56,250 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:48:56,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:48:56,251 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:48:56,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:48:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:48:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2022-04-15 13:48:56,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:48:56,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:48:56,264 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:48:56,264 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:48:56,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:56,267 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-15 13:48:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-15 13:48:56,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:56,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:56,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-15 13:48:56,269 INFO L87 Difference]: Start difference. First operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 48 states. [2022-04-15 13:48:56,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:56,271 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2022-04-15 13:48:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2022-04-15 13:48:56,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:56,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:56,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:48:56,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:48:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 15 states have call successors, (15), 5 states have call predecessors, (15), 4 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 13:48:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2022-04-15 13:48:56,274 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 17 [2022-04-15 13:48:56,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:48:56,274 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2022-04-15 13:48:56,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 13:48:56,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 49 transitions. [2022-04-15 13:48:56,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:56,316 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2022-04-15 13:48:56,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:48:56,316 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:56,316 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:56,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:48:56,531 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:48:56,532 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:56,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 1 times [2022-04-15 13:48:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:56,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642843160] [2022-04-15 13:48:56,532 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:48:56,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1612678773, now seen corresponding path program 2 times [2022-04-15 13:48:56,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:48:56,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079319582] [2022-04-15 13:48:56,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:48:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:48:56,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:48:56,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516316313] [2022-04-15 13:48:56,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:48:56,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:48:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:48:56,544 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:48:56,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:48:56,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:48:56,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:48:56,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:48:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:56,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:48:56,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {1010#true} call ULTIMATE.init(); {1010#true} is VALID [2022-04-15 13:48:56,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {1010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1010#true} is VALID [2022-04-15 13:48:56,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-15 13:48:56,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1010#true} {1010#true} #81#return; {1010#true} is VALID [2022-04-15 13:48:56,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#true} call #t~ret6 := main(); {1010#true} is VALID [2022-04-15 13:48:56,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:48:56,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:48:56,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:48:56,679 INFO L272 TraceCheckUtils]: 8: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1010#true} is VALID [2022-04-15 13:48:56,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-15 13:48:56,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-15 13:48:56,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-15 13:48:56,680 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #59#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:48:56,680 INFO L272 TraceCheckUtils]: 13: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1010#true} is VALID [2022-04-15 13:48:56,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {1010#true} ~cond := #in~cond; {1010#true} is VALID [2022-04-15 13:48:56,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#true} assume !(0 == ~cond); {1010#true} is VALID [2022-04-15 13:48:56,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#true} assume true; {1010#true} is VALID [2022-04-15 13:48:56,681 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1010#true} {1030#(and (= main_~x~0 0) (= main_~n~0 0))} #61#return; {1030#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 13:48:56,681 INFO L272 TraceCheckUtils]: 18: Hoare triple {1030#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:48:56,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {1070#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1074#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:48:56,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1011#false} is VALID [2022-04-15 13:48:56,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {1011#false} assume !false; {1011#false} is VALID [2022-04-15 13:48:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 13:48:56,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:48:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:48:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079319582] [2022-04-15 13:48:56,683 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:48:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516316313] [2022-04-15 13:48:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516316313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:56,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:56,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:48:56,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:48:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642843160] [2022-04-15 13:48:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642843160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:56,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:56,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:48:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553618104] [2022-04-15 13:48:56,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:48:56,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 13:48:56,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:48:56,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:48:56,698 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-15 13:48:56,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:48:56,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:48:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:48:56,700 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:48:56,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:56,963 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-15 13:48:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:48:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-15 13:48:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:48:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:48:56,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:48:56,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:48:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:48:56,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 13:48:57,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:57,037 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:48:57,037 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:48:57,038 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-15 13:48:57,038 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:48:57,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:48:57,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:48:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2022-04-15 13:48:57,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:48:57,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:48:57,052 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:48:57,053 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:48:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:57,055 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 13:48:57,055 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 13:48:57,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:57,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:57,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-15 13:48:57,056 INFO L87 Difference]: Start difference. First operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 52 states. [2022-04-15 13:48:57,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:57,058 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 13:48:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 13:48:57,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:57,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:57,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:48:57,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:48:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 20 states have call successors, (20), 6 states have call predecessors, (20), 5 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 13:48:57,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2022-04-15 13:48:57,061 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 22 [2022-04-15 13:48:57,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:48:57,061 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2022-04-15 13:48:57,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 13:48:57,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 64 transitions. [2022-04-15 13:48:57,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2022-04-15 13:48:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:48:57,126 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:57,127 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:57,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 13:48:57,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:48:57,327 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:57,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:57,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 1 times [2022-04-15 13:48:57,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:57,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [288619930] [2022-04-15 13:48:57,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:48:57,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1625830715, now seen corresponding path program 2 times [2022-04-15 13:48:57,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:48:57,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916316497] [2022-04-15 13:48:57,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:48:57,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:48:57,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:48:57,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022986982] [2022-04-15 13:48:57,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:48:57,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:48:57,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:48:57,346 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:48:57,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:48:57,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:48:57,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:48:57,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:48:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:48:57,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:48:57,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {1390#true} call ULTIMATE.init(); {1390#true} is VALID [2022-04-15 13:48:57,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#true} is VALID [2022-04-15 13:48:57,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:48:57,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#true} {1390#true} #81#return; {1390#true} is VALID [2022-04-15 13:48:57,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#true} call #t~ret6 := main(); {1390#true} is VALID [2022-04-15 13:48:57,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4;~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:48:57,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:48:57,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !!(#t~post5 < 20);havoc #t~post5; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:48:57,549 INFO L272 TraceCheckUtils]: 8: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-15 13:48:57,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-15 13:48:57,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-15 13:48:57,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:48:57,550 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #59#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:48:57,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1390#true} is VALID [2022-04-15 13:48:57,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-15 13:48:57,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-15 13:48:57,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:48:57,551 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #61#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:48:57,552 INFO L272 TraceCheckUtils]: 18: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1390#true} is VALID [2022-04-15 13:48:57,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {1390#true} ~cond := #in~cond; {1390#true} is VALID [2022-04-15 13:48:57,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {1390#true} assume !(0 == ~cond); {1390#true} is VALID [2022-04-15 13:48:57,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {1390#true} assume true; {1390#true} is VALID [2022-04-15 13:48:57,553 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1390#true} {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #63#return; {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 13:48:57,556 INFO L272 TraceCheckUtils]: 23: Hoare triple {1410#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:48:57,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1465#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1469#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:48:57,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {1469#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1391#false} is VALID [2022-04-15 13:48:57,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {1391#false} assume !false; {1391#false} is VALID [2022-04-15 13:48:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 13:48:57,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:48:57,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:48:57,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916316497] [2022-04-15 13:48:57,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:48:57,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022986982] [2022-04-15 13:48:57,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022986982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:57,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:57,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:48:57,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:48:57,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [288619930] [2022-04-15 13:48:57,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [288619930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:48:57,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:48:57,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:48:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89340483] [2022-04-15 13:48:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:48:57,558 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 13:48:57,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:48:57,558 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, (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-15 13:48:57,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:57,576 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:48:57,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:57,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:48:57,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:48:57,576 INFO L87 Difference]: Start difference. First operand 48 states and 64 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, (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-15 13:48:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:57,876 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-04-15 13:48:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:48:57,876 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, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 13:48:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:48:57,877 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, (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-15 13:48:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:48:57,878 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, (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-15 13:48:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 13:48:57,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 13:48:57,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:57,927 INFO L225 Difference]: With dead ends: 62 [2022-04-15 13:48:57,927 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:48:57,928 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:48:57,928 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:48:57,928 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 130 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:48:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:48:57,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 13:48:57,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:48:57,948 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:48:57,949 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:48:57,949 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:48:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:57,951 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-15 13:48:57,951 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:48:57,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:57,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:57,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-15 13:48:57,951 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 50 states. [2022-04-15 13:48:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:48:57,968 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-15 13:48:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:48:57,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:48:57,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:48:57,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:48:57,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:48:57,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 18 states have call successors, (18), 7 states have call predecessors, (18), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 13:48:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2022-04-15 13:48:57,972 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 27 [2022-04-15 13:48:57,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:48:57,972 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2022-04-15 13:48:57,972 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, (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-15 13:48:57,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 62 transitions. [2022-04-15 13:48:58,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:48:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-15 13:48:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:48:58,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:48:58,011 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:48:58,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:48:58,211 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:48:58,212 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:48:58,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:48:58,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1440923632, now seen corresponding path program 1 times [2022-04-15 13:48:58,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:48:58,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552610257]