/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/cohendiv-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:03:43,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:03:43,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:03:43,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:03:43,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:03:43,306 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:03:43,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:03:43,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:03:43,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:03:43,315 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:03:43,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:03:43,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:03:43,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:03:43,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:03:43,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:03:43,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:03:43,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:03:43,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:03:43,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:03:43,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:03:43,329 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:03:43,330 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:03:43,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:03:43,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:03:43,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:03:43,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:03:43,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:03:43,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:03:43,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:03:43,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:03:43,339 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:03:43,339 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:03:43,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:03:43,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:03:43,341 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:03:43,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:03:43,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:03:43,342 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:03:43,342 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:03:43,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:03:43,343 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:03:43,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:03:43,344 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 14:03:43,352 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:03:43,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:03:43,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:03:43,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:03:43,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:03:43,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:03:43,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:03:43,354 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:03:43,354 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:03:43,355 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:03:43,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:03:43,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:03:43,356 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:03:43,356 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 14:03:43,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:03:43,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:03:43,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:03:43,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:03:43,562 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:03:43,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound5.c [2022-04-15 14:03:43,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5969ec2/edc5d43ce77448c688e514f808eb543d/FLAGcf345d482 [2022-04-15 14:03:44,012 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:03:44,013 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound5.c [2022-04-15 14:03:44,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5969ec2/edc5d43ce77448c688e514f808eb543d/FLAGcf345d482 [2022-04-15 14:03:44,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d5969ec2/edc5d43ce77448c688e514f808eb543d [2022-04-15 14:03:44,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:03:44,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:03:44,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:03:44,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:03:44,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:03:44,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6916d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44, skipping insertion in model container [2022-04-15 14:03:44,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:03:44,069 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:03:44,173 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/cohendiv-ll_unwindbound5.c[576,589] [2022-04-15 14:03:44,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:03:44,210 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:03:44,219 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/cohendiv-ll_unwindbound5.c[576,589] [2022-04-15 14:03:44,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:03:44,242 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:03:44,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44 WrapperNode [2022-04-15 14:03:44,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:03:44,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:03:44,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:03:44,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:03:44,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:03:44,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:03:44,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:03:44,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:03:44,272 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (1/1) ... [2022-04-15 14:03:44,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:03:44,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:44,306 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 14:03:44,325 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 14:03:44,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:03:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:03:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:03:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:03:44,347 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:03:44,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:03:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:03:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:03:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:03:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:03:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 14:03:44,348 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:03:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:03:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:03:44,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:03:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:03:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:03:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:03:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:03:44,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:03:44,405 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:03:44,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:03:44,646 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:03:44,654 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:03:44,654 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:03:44,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:03:44 BoogieIcfgContainer [2022-04-15 14:03:44,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:03:44,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:03:44,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:03:44,660 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:03:44,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:03:44" (1/3) ... [2022-04-15 14:03:44,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d07b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:03:44, skipping insertion in model container [2022-04-15 14:03:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:03:44" (2/3) ... [2022-04-15 14:03:44,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d07b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:03:44, skipping insertion in model container [2022-04-15 14:03:44,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:03:44" (3/3) ... [2022-04-15 14:03:44,662 INFO L111 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound5.c [2022-04-15 14:03:44,667 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:03:44,667 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:03:44,704 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:03:44,709 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 14:03:44,709 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:03:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:03:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 14:03:44,730 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:44,730 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:44,731 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:44,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:44,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 1 times [2022-04-15 14:03:44,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:44,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1953640851] [2022-04-15 14:03:44,750 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1588022502, now seen corresponding path program 2 times [2022-04-15 14:03:44,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:44,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415502404] [2022-04-15 14:03:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:03:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:44,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-15 14:03:44,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:03:44,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-15 14:03:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:03:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:44,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:03:44,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:03:44,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:03:44,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-15 14:03:44,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {50#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:03:44,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {41#true} is VALID [2022-04-15 14:03:44,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:03:44,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #93#return; {41#true} is VALID [2022-04-15 14:03:44,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2022-04-15 14:03:44,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {41#true} is VALID [2022-04-15 14:03:44,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {41#true} is VALID [2022-04-15 14:03:44,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:03:44,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:03:44,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:03:44,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #77#return; {42#false} is VALID [2022-04-15 14:03:44,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {42#false} is VALID [2022-04-15 14:03:44,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-04-15 14:03:44,918 INFO L272 TraceCheckUtils]: 13: Hoare triple {42#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {42#false} is VALID [2022-04-15 14:03:44,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 14:03:44,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 14:03:44,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 14:03:44,919 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 14:03:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:44,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415502404] [2022-04-15 14:03:44,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415502404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:44,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:44,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:03:44,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:44,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1953640851] [2022-04-15 14:03:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1953640851] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:44,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:03:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379779451] [2022-04-15 14:03:44,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:44,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 14:03:44,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:44,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:44,957 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 14:03:44,957 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:03:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:44,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:03:44,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:03:44,977 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 23 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:45,133 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-04-15 14:03:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:03:45,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 14:03:45,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 14:03:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:45,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 14:03:45,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 14:03:45,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:45,247 INFO L225 Difference]: With dead ends: 68 [2022-04-15 14:03:45,247 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:03:45,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:03:45,253 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:45,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:03:45,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 14:03:45,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:45,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,301 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,302 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:45,306 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 14:03:45,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:03:45,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:45,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:45,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 14:03:45,308 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 34 states. [2022-04-15 14:03:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:45,337 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 14:03:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 14:03:45,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:45,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:45,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:45,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-04-15 14:03:45,341 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 17 [2022-04-15 14:03:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:45,342 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-04-15 14:03:45,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:45,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 42 transitions. [2022-04-15 14:03:45,396 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 14:03:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-04-15 14:03:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:03:45,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:45,398 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:45,398 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:03:45,399 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:45,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:45,401 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 1 times [2022-04-15 14:03:45,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:45,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [472520723] [2022-04-15 14:03:45,406 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:45,406 INFO L85 PathProgramCache]: Analyzing trace with hash 766070672, now seen corresponding path program 2 times [2022-04-15 14:03:45,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:45,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92703595] [2022-04-15 14:03:45,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:45,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:45,448 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:45,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656635331] [2022-04-15 14:03:45,448 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:45,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:45,455 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 14:03:45,481 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 14:03:45,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:03:45,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:45,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:03:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:45,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:45,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {323#true} call ULTIMATE.init(); {323#true} is VALID [2022-04-15 14:03:45,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {323#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {331#(<= ~counter~0 0)} {323#true} #93#return; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {331#(<= ~counter~0 0)} call #t~ret8 := main(); {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {331#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {331#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(<= ~counter~0 0)} ~cond := #in~cond; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {331#(<= ~counter~0 0)} assume !(0 == ~cond); {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(<= ~counter~0 0)} assume true; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {331#(<= ~counter~0 0)} {331#(<= ~counter~0 0)} #77#return; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {331#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {331#(<= ~counter~0 0)} is VALID [2022-04-15 14:03:45,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {331#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {365#(<= |main_#t~post6| 0)} is VALID [2022-04-15 14:03:45,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {324#false} is VALID [2022-04-15 14:03:45,678 INFO L272 TraceCheckUtils]: 14: Hoare triple {324#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {324#false} is VALID [2022-04-15 14:03:45,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#false} ~cond := #in~cond; {324#false} is VALID [2022-04-15 14:03:45,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {324#false} assume 0 == ~cond; {324#false} is VALID [2022-04-15 14:03:45,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {324#false} assume !false; {324#false} is VALID [2022-04-15 14:03:45,679 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 14:03:45,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:45,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:45,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92703595] [2022-04-15 14:03:45,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:45,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656635331] [2022-04-15 14:03:45,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656635331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:45,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:45,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:03:45,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:45,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [472520723] [2022-04-15 14:03:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [472520723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:45,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:45,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:03:45,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819097208] [2022-04-15 14:03:45,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:45,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 14:03:45,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:45,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:45,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:45,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:03:45,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:45,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:03:45,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:03:45,701 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:45,806 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 14:03:45,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:03:45,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-15 14:03:45,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:45,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 14:03:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2022-04-15 14:03:45,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2022-04-15 14:03:45,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:45,850 INFO L225 Difference]: With dead ends: 42 [2022-04-15 14:03:45,850 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:03:45,851 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:03:45,851 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:45,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:45,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:03:45,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 14:03:45,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:45,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,864 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,864 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:45,867 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 14:03:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 14:03:45,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:45,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:45,868 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-15 14:03:45,868 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 35 states. [2022-04-15 14:03:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:45,871 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 14:03:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 14:03:45,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:45,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:45,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:45,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:03:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 14:03:45,874 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 18 [2022-04-15 14:03:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:45,874 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 14:03:45,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 14:03:45,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 14:03:45,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:45,912 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 14:03:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 14:03:45,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:45,912 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:45,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 14:03:46,130 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:46,131 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:46,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 1 times [2022-04-15 14:03:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:46,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1875212847] [2022-04-15 14:03:46,132 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash 767560222, now seen corresponding path program 2 times [2022-04-15 14:03:46,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:46,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301059777] [2022-04-15 14:03:46,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:46,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:46,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:46,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113843079] [2022-04-15 14:03:46,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:46,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:46,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:46,149 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 14:03:46,150 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 14:03:46,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:03:46,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:46,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:03:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:46,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:46,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-15 14:03:46,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {604#true} is VALID [2022-04-15 14:03:46,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-15 14:03:46,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #93#return; {604#true} is VALID [2022-04-15 14:03:46,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret8 := main(); {604#true} is VALID [2022-04-15 14:03:46,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-15 14:03:46,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {604#true} is VALID [2022-04-15 14:03:46,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-15 14:03:46,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-15 14:03:46,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-15 14:03:46,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #77#return; {604#true} is VALID [2022-04-15 14:03:46,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:03:46,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:03:46,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {642#(and (= main_~a~0 0) (= main_~b~0 0))} is VALID [2022-04-15 14:03:46,283 INFO L272 TraceCheckUtils]: 14: Hoare triple {642#(and (= main_~a~0 0) (= main_~b~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:03:46,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:03:46,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-15 14:03:46,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-15 14:03:46,285 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 14:03:46,285 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:46,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301059777] [2022-04-15 14:03:46,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:46,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113843079] [2022-04-15 14:03:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113843079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:46,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:46,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:46,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1875212847] [2022-04-15 14:03:46,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1875212847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:46,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:46,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:46,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424963593] [2022-04-15 14:03:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:46,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 14:03:46,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:46,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:46,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:46,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:03:46,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:46,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:03:46,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:03:46,301 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:46,441 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-15 14:03:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:03:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 14:03:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:46,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 14:03:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-15 14:03:46,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-15 14:03:46,483 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 14:03:46,484 INFO L225 Difference]: With dead ends: 45 [2022-04-15 14:03:46,485 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 14:03:46,485 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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 14:03:46,486 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:46,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 145 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:46,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 14:03:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2022-04-15 14:03:46,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:46,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:46,500 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:46,500 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:46,503 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 14:03:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 14:03:46,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:46,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:46,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-15 14:03:46,504 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 43 states. [2022-04-15 14:03:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:46,506 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-04-15 14:03:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-04-15 14:03:46,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:46,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:46,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:46,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 14:03:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-04-15 14:03:46,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 18 [2022-04-15 14:03:46,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:46,509 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-04-15 14:03:46,509 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 14:03:46,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 49 transitions. [2022-04-15 14:03:46,546 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 14:03:46,547 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-15 14:03:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:03:46,547 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:46,547 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:46,565 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 14:03:46,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 14:03:46,766 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:46,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 1 times [2022-04-15 14:03:46,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:46,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880662349] [2022-04-15 14:03:46,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:46,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1016228092, now seen corresponding path program 2 times [2022-04-15 14:03:46,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:46,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706166462] [2022-04-15 14:03:46,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:46,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:46,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:46,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [73849983] [2022-04-15 14:03:46,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:46,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:46,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:46,782 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 14:03:46,783 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 14:03:46,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:03:46,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:46,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:03:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:46,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:46,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {920#true} call ULTIMATE.init(); {920#true} is VALID [2022-04-15 14:03:46,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {920#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {920#true} is VALID [2022-04-15 14:03:46,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 14:03:46,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {920#true} {920#true} #93#return; {920#true} is VALID [2022-04-15 14:03:46,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {920#true} call #t~ret8 := main(); {920#true} is VALID [2022-04-15 14:03:46,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {920#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {920#true} is VALID [2022-04-15 14:03:46,929 INFO L272 TraceCheckUtils]: 6: Hoare triple {920#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {920#true} is VALID [2022-04-15 14:03:46,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-15 14:03:46,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-15 14:03:46,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 14:03:46,930 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {920#true} {920#true} #77#return; {920#true} is VALID [2022-04-15 14:03:46,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:46,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:46,932 INFO L290 TraceCheckUtils]: 13: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:46,932 INFO L272 TraceCheckUtils]: 14: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {920#true} is VALID [2022-04-15 14:03:46,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#true} ~cond := #in~cond; {920#true} is VALID [2022-04-15 14:03:46,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {920#true} assume !(0 == ~cond); {920#true} is VALID [2022-04-15 14:03:46,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {920#true} assume true; {920#true} is VALID [2022-04-15 14:03:46,934 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {920#true} {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} #79#return; {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:03:46,935 INFO L272 TraceCheckUtils]: 19: Hoare triple {958#(and (= main_~x~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {983#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:03:46,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {983#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {987#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:03:46,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {921#false} is VALID [2022-04-15 14:03:46,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {921#false} assume !false; {921#false} is VALID [2022-04-15 14:03:46,937 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 14:03:46,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:46,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:46,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706166462] [2022-04-15 14:03:46,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:46,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73849983] [2022-04-15 14:03:46,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73849983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:46,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:46,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:46,938 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:46,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880662349] [2022-04-15 14:03:46,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880662349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:46,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471489527] [2022-04-15 14:03:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:46,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 23 [2022-04-15 14:03:46,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:46,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 14:03:46,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:46,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:03:46,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:46,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:03:46,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:03:46,958 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 14:03:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:47,139 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-15 14:03:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:03:47,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 23 [2022-04-15 14:03:47,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 14:03:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 14:03:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 14:03:47,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-15 14:03:47,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-15 14:03:47,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:47,194 INFO L225 Difference]: With dead ends: 58 [2022-04-15 14:03:47,194 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 14:03:47,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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 14:03:47,195 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:47,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 139 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 14:03:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-15 14:03:47,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:47,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:47,213 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:47,213 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:47,216 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 14:03:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 14:03:47,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:47,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:47,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-15 14:03:47,217 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-15 14:03:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:47,226 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-15 14:03:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-15 14:03:47,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:47,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:47,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:47,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:47,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 14:03:47,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-15 14:03:47,229 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 23 [2022-04-15 14:03:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:47,229 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-15 14:03:47,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (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 14:03:47,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 69 transitions. [2022-04-15 14:03:47,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-15 14:03:47,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 14:03:47,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:47,288 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:03:47,305 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 14:03:47,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:47,493 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 1 times [2022-04-15 14:03:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [717986550] [2022-04-15 14:03:47,494 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:03:47,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2019703110, now seen corresponding path program 2 times [2022-04-15 14:03:47,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:03:47,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486035147] [2022-04-15 14:03:47,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:03:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:03:47,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:03:47,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507829607] [2022-04-15 14:03:47,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:03:47,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:47,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:03:47,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:03:47,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 14:03:47,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:03:47,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:03:47,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:03:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:03:47,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:03:47,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {1329#true} call ULTIMATE.init(); {1329#true} is VALID [2022-04-15 14:03:47,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {1329#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1329#true} is VALID [2022-04-15 14:03:47,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:47,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1329#true} {1329#true} #93#return; {1329#true} is VALID [2022-04-15 14:03:47,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {1329#true} call #t~ret8 := main(); {1329#true} is VALID [2022-04-15 14:03:47,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {1329#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {1329#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1329#true} {1329#true} #77#return; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {1329#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {1329#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {1329#true} assume !!(#t~post6 < 5);havoc #t~post6; {1329#true} is VALID [2022-04-15 14:03:47,685 INFO L272 TraceCheckUtils]: 14: Hoare triple {1329#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1329#true} is VALID [2022-04-15 14:03:47,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 14:03:47,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 14:03:47,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:47,696 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1329#true} {1329#true} #79#return; {1329#true} is VALID [2022-04-15 14:03:47,699 INFO L272 TraceCheckUtils]: 19: Hoare triple {1329#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1329#true} is VALID [2022-04-15 14:03:47,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {1329#true} ~cond := #in~cond; {1329#true} is VALID [2022-04-15 14:03:47,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {1329#true} assume !(0 == ~cond); {1329#true} is VALID [2022-04-15 14:03:47,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {1329#true} assume true; {1329#true} is VALID [2022-04-15 14:03:47,700 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1329#true} {1329#true} #81#return; {1329#true} is VALID [2022-04-15 14:03:47,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {1329#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 14:03:47,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 14:03:47,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} assume !!(#t~post7 < 5);havoc #t~post7; {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} is VALID [2022-04-15 14:03:47,703 INFO L272 TraceCheckUtils]: 27: Hoare triple {1406#(and (= main_~a~0 1) (= main_~b~0 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:03:47,703 INFO L290 TraceCheckUtils]: 28: Hoare triple {1416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:03:47,703 INFO L290 TraceCheckUtils]: 29: Hoare triple {1420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1330#false} is VALID [2022-04-15 14:03:47,703 INFO L290 TraceCheckUtils]: 30: Hoare triple {1330#false} assume !false; {1330#false} is VALID [2022-04-15 14:03:47,704 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 14:03:47,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:03:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:03:47,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486035147] [2022-04-15 14:03:47,704 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:03:47,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507829607] [2022-04-15 14:03:47,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507829607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:47,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:47,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:47,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:03:47,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [717986550] [2022-04-15 14:03:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [717986550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:03:47,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:03:47,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:03:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639874131] [2022-04-15 14:03:47,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:03:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 14:03:47,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:03:47,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:03:47,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:47,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:03:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:47,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:03:47,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:03:47,726 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:03:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:47,925 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-15 14:03:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:03:47,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-04-15 14:03:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:03:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:03:47,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 14:03:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:03:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-15 14:03:47,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-15 14:03:47,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:47,987 INFO L225 Difference]: With dead ends: 83 [2022-04-15 14:03:47,987 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 14:03:47,988 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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 14:03:47,988 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:03:47,988 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 145 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:03:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 14:03:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2022-04-15 14:03:48,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:03:48,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:48,011 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:48,011 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:48,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:48,015 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 14:03:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-15 14:03:48,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:48,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:48,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-15 14:03:48,016 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 81 states. [2022-04-15 14:03:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:03:48,019 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2022-04-15 14:03:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 111 transitions. [2022-04-15 14:03:48,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:03:48,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:03:48,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:03:48,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:03:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 46 states have internal predecessors, (56), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:03:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 100 transitions. [2022-04-15 14:03:48,023 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 100 transitions. Word has length 31 [2022-04-15 14:03:48,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:03:48,023 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 100 transitions. [2022-04-15 14:03:48,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 14:03:48,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 100 transitions. [2022-04-15 14:03:48,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:03:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 100 transitions. [2022-04-15 14:03:48,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:03:48,119 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:03:48,119 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1] [2022-04-15 14:03:48,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 14:03:48,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:03:48,327 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:03:48,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:03:48,328 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 1 times [2022-04-15 14:03:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:03:48,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146063506] [2022-04-15 14:14:27,942 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 14:14:27,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1923851590, now seen corresponding path program 1 times [2022-04-15 14:14:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:27,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664319401] [2022-04-15 14:14:27,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:27,963 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:14:27,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382419356] [2022-04-15 14:14:27,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:27,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:27,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:14:27,971 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:14:28,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 14:14:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 14:14:28,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 14:14:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 14:14:28,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 14:14:28,051 INFO L85 PathProgramCache]: Analyzing trace with hash 202176206, now seen corresponding path program 2 times [2022-04-15 14:14:28,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:28,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638331866] [2022-04-15 14:14:28,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:28,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:28,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:14:28,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164151006] [2022-04-15 14:14:28,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:14:28,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:28,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:14:28,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:14:28,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 14:14:28,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:14:28,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:14:28,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:14:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:28,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:14:28,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {1904#true} call ULTIMATE.init(); {1904#true} is VALID [2022-04-15 14:14:28,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {1904#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1912#(<= ~counter~0 0)} {1904#true} #93#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {1912#(<= ~counter~0 0)} call #t~ret8 := main(); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {1912#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {1912#(<= ~counter~0 0)} ~cond := #in~cond; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {1912#(<= ~counter~0 0)} assume !(0 == ~cond); {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {1912#(<= ~counter~0 0)} assume true; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,368 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1912#(<= ~counter~0 0)} {1912#(<= ~counter~0 0)} #77#return; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {1912#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {1912#(<= ~counter~0 0)} is VALID [2022-04-15 14:14:28,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {1912#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {1946#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,370 INFO L272 TraceCheckUtils]: 14: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,372 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #79#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,372 INFO L272 TraceCheckUtils]: 19: Hoare triple {1946#(<= ~counter~0 1)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(<= ~counter~0 1)} ~cond := #in~cond; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {1946#(<= ~counter~0 1)} assume !(0 == ~cond); {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {1946#(<= ~counter~0 1)} assume true; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,374 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1946#(<= ~counter~0 1)} {1946#(<= ~counter~0 1)} #81#return; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {1946#(<= ~counter~0 1)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {1946#(<= ~counter~0 1)} is VALID [2022-04-15 14:14:28,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {1946#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1986#(<= |main_#t~post7| 1)} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {1986#(<= |main_#t~post7| 1)} assume !(#t~post7 < 5);havoc #t~post7; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {1905#false} ~r~0 := ~r~0 - ~b~0;~q~0 := ~q~0 + ~a~0; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {1905#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {1905#false} assume !(#t~post6 < 5);havoc #t~post6; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L272 TraceCheckUtils]: 30: Hoare triple {1905#false} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 31: Hoare triple {1905#false} ~cond := #in~cond; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 32: Hoare triple {1905#false} assume 0 == ~cond; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {1905#false} assume !false; {1905#false} is VALID [2022-04-15 14:14:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:14:28,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:14:28,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638331866] [2022-04-15 14:14:28,376 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:14:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164151006] [2022-04-15 14:14:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164151006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:28,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:14:28,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146063506] [2022-04-15 14:14:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146063506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:28,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:14:28,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187474171] [2022-04-15 14:14:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:28,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-15 14:14:28,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:28,378 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:14:28,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:28,406 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:14:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:28,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:14:28,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:14:28,406 INFO L87 Difference]: Start difference. First operand 74 states and 100 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:14:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:28,521 INFO L93 Difference]: Finished difference Result 113 states and 153 transitions. [2022-04-15 14:14:28,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:14:28,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2022-04-15 14:14:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:14:28,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:14:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-15 14:14:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:14:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-04-15 14:14:28,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2022-04-15 14:14:28,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:28,582 INFO L225 Difference]: With dead ends: 113 [2022-04-15 14:14:28,582 INFO L226 Difference]: Without dead ends: 78 [2022-04-15 14:14:28,583 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:14:28,583 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:14:28,583 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:14:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-15 14:14:28,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-15 14:14:28,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:14:28,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:28,632 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:28,632 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:28,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:28,637 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-15 14:14:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 14:14:28,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:28,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:28,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-15 14:14:28,639 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 78 states. [2022-04-15 14:14:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:28,641 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2022-04-15 14:14:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 14:14:28,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:28,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:28,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:14:28,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:14:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 23 states have call successors, (23), 8 states have call predecessors, (23), 7 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2022-04-15 14:14:28,645 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2022-04-15 14:14:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:14:28,645 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2022-04-15 14:14:28,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:14:28,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 102 transitions. [2022-04-15 14:14:28,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2022-04-15 14:14:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 14:14:28,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:28,736 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 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 14:14:28,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 14:14:28,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 14:14:29,136 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:29,138 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:29,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 1 times [2022-04-15 14:14:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:29,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1212876967] [2022-04-15 14:14:29,139 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:14:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1813008070, now seen corresponding path program 2 times [2022-04-15 14:14:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:29,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879993220] [2022-04-15 14:14:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:29,154 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:14:29,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [814413063] [2022-04-15 14:14:29,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:14:29,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:29,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:14:29,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:14:29,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 14:14:29,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:14:29,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:14:29,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:14:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:29,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:14:29,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #93#return; {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret8 := main(); {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L272 TraceCheckUtils]: 6: Hoare triple {2548#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:14:29,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {2548#true} ~cond := #in~cond; {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:14:29,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {2574#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:14:29,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2578#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:14:29,366 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2578#(not (= |assume_abort_if_not_#in~cond| 0))} {2548#true} #77#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:14:29,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {2585#(<= 1 main_~y~0)} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:14:29,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {2585#(<= 1 main_~y~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:14:29,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(#t~post6 < 5);havoc #t~post6; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:14:29,366 INFO L272 TraceCheckUtils]: 14: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:14:29,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:14:29,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:14:29,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:14:29,367 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #79#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:14:29,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {2585#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:14:29,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:14:29,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:14:29,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:14:29,368 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2548#true} {2585#(<= 1 main_~y~0)} #81#return; {2585#(<= 1 main_~y~0)} is VALID [2022-04-15 14:14:29,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {2585#(<= 1 main_~y~0)} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:14:29,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {2628#(<= 1 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:14:29,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {2628#(<= 1 main_~r~0)} assume !!(#t~post7 < 5);havoc #t~post7; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:14:29,370 INFO L272 TraceCheckUtils]: 27: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:14:29,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:14:29,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:14:29,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:14:29,371 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #83#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:14:29,371 INFO L272 TraceCheckUtils]: 32: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {2548#true} is VALID [2022-04-15 14:14:29,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {2548#true} ~cond := #in~cond; {2548#true} is VALID [2022-04-15 14:14:29,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {2548#true} assume !(0 == ~cond); {2548#true} is VALID [2022-04-15 14:14:29,371 INFO L290 TraceCheckUtils]: 35: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-15 14:14:29,372 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2548#true} {2628#(<= 1 main_~r~0)} #85#return; {2628#(<= 1 main_~r~0)} is VALID [2022-04-15 14:14:29,372 INFO L272 TraceCheckUtils]: 37: Hoare triple {2628#(<= 1 main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:14:29,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {2668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:14:29,373 INFO L290 TraceCheckUtils]: 39: Hoare triple {2672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2549#false} is VALID [2022-04-15 14:14:29,373 INFO L290 TraceCheckUtils]: 40: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-15 14:14:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:14:29,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:14:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879993220] [2022-04-15 14:14:29,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:14:29,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814413063] [2022-04-15 14:14:29,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814413063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:29,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:29,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:14:29,374 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:29,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1212876967] [2022-04-15 14:14:29,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1212876967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:29,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:29,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:14:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641965514] [2022-04-15 14:14:29,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:29,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-15 14:14:29,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:29,375 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:14:29,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:29,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:14:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:14:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-15 14:14:29,393 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:14:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:29,690 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2022-04-15 14:14:29,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:14:29,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-04-15 14:14:29,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:14:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:14:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:14:29,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:14:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:14:29,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 14:14:29,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:29,727 INFO L225 Difference]: With dead ends: 84 [2022-04-15 14:14:29,727 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 14:14:29,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 14:14:29,728 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:14:29,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 167 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:14:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 14:14:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-04-15 14:14:29,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:14:29,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:29,803 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:29,803 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:29,805 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 14:14:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 14:14:29,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:29,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:29,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-15 14:14:29,806 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 82 states. [2022-04-15 14:14:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:29,808 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2022-04-15 14:14:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 14:14:29,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:29,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:29,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:14:29,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:14:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.22) internal successors, (61), 52 states have internal predecessors, (61), 23 states have call successors, (23), 9 states have call predecessors, (23), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 105 transitions. [2022-04-15 14:14:29,811 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 105 transitions. Word has length 41 [2022-04-15 14:14:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:14:29,811 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 105 transitions. [2022-04-15 14:14:29,811 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 14:14:29,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 105 transitions. [2022-04-15 14:14:29,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:29,910 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2022-04-15 14:14:29,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 14:14:29,910 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:29,910 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 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 14:14:29,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 14:14:30,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:30,124 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:30,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 1 times [2022-04-15 14:14:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:30,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [286626478] [2022-04-15 14:14:30,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:14:30,124 INFO L85 PathProgramCache]: Analyzing trace with hash -683043127, now seen corresponding path program 2 times [2022-04-15 14:14:30,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:30,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514650601] [2022-04-15 14:14:30,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:30,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:30,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:14:30,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55416702] [2022-04-15 14:14:30,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:14:30,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:30,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:14:30,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:14:30,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 14:14:30,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:14:30,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:14:30,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:14:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:30,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:14:30,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-15 14:14:30,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 5);havoc #t~post6; {3180#true} is VALID [2022-04-15 14:14:30,389 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-15 14:14:30,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 5);havoc #t~post7; {3180#true} is VALID [2022-04-15 14:14:30,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:30,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:14:30,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {3269#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:14:30,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:14:30,392 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:14:30,392 INFO L272 TraceCheckUtils]: 32: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:30,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:30,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:30,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:30,393 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #85#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:14:30,393 INFO L272 TraceCheckUtils]: 37: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:30,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:30,393 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:30,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:30,394 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} #87#return; {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} is VALID [2022-04-15 14:14:30,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#(= main_~b~0 (* main_~a~0 main_~y~0))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 14:14:30,395 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:14:30,396 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:14:30,396 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-15 14:14:30,396 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-15 14:14:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 14:14:30,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:14:36,944 INFO L290 TraceCheckUtils]: 46: Hoare triple {3181#false} assume !false; {3181#false} is VALID [2022-04-15 14:14:36,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {3322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3181#false} is VALID [2022-04-15 14:14:36,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:14:36,946 INFO L272 TraceCheckUtils]: 43: Hoare triple {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} call __VERIFIER_assert((if ~r~0 >= 2 * ~y~0 * ~a~0 then 1 else 0)); {3318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:14:36,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} assume !!(~r~0 >= 2 * ~b~0); {3314#(<= (* 2 (* main_~a~0 main_~y~0)) main_~r~0)} is VALID [2022-04-15 14:14:36,947 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #87#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:14:36,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:36,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:36,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:36,947 INFO L272 TraceCheckUtils]: 37: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~r~0 >= 0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:36,948 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3180#true} {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} #85#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:14:36,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:36,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:36,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:36,948 INFO L272 TraceCheckUtils]: 32: Hoare triple {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:36,949 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} {3180#true} #83#return; {3341#(<= (* 2 (* main_~a~0 main_~y~0)) (* main_~b~0 2))} is VALID [2022-04-15 14:14:36,949 INFO L290 TraceCheckUtils]: 30: Hoare triple {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3273#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {3180#true} ~cond := #in~cond; {3384#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:14:36,950 INFO L272 TraceCheckUtils]: 27: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {3180#true} assume !!(#t~post7 < 5);havoc #t~post7; {3180#true} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {3180#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3180#true} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#true} assume !!(~r~0 >= ~y~0);~a~0 := 1;~b~0 := ~y~0; {3180#true} is VALID [2022-04-15 14:14:36,950 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3180#true} {3180#true} #81#return; {3180#true} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:36,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L272 TraceCheckUtils]: 19: Hoare triple {3180#true} call __VERIFIER_assert((if ~x~0 == ~q~0 * ~y~0 + ~r~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3180#true} {3180#true} #79#return; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L272 TraceCheckUtils]: 14: Hoare triple {3180#true} call __VERIFIER_assert((if ~b~0 == ~y~0 * ~a~0 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#true} assume !!(#t~post6 < 5);havoc #t~post6; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {3180#true} ~q~0 := 0;~r~0 := ~x~0;~a~0 := 0;~b~0 := 0; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3180#true} {3180#true} #77#return; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:36,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {3180#true} assume !(0 == ~cond); {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {3180#true} ~cond := #in~cond; {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L272 TraceCheckUtils]: 6: Hoare triple {3180#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {3180#true} havoc ~x~0;havoc ~y~0;havoc ~q~0;havoc ~r~0;havoc ~a~0;havoc ~b~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {3180#true} call #t~ret8 := main(); {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3180#true} {3180#true} #93#return; {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {3180#true} assume true; {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {3180#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(14, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {3180#true} call ULTIMATE.init(); {3180#true} is VALID [2022-04-15 14:14:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 14:14:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:36,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514650601] [2022-04-15 14:14:36,953 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:14:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55416702] [2022-04-15 14:14:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55416702] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:14:36,953 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:14:36,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 14:14:36,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:36,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [286626478] [2022-04-15 14:14:36,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [286626478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:36,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:36,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 14:14:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684282447] [2022-04-15 14:14:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:36,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 14:14:36,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:36,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:14:36,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:36,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 14:14:36,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:36,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 14:14:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 14:14:36,980 INFO L87 Difference]: Start difference. First operand 82 states and 105 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:14:37,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:37,296 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2022-04-15 14:14:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:14:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-04-15 14:14:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:14:37,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:14:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:14:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:14:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 14:14:37,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 14:14:37,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:37,335 INFO L225 Difference]: With dead ends: 88 [2022-04-15 14:14:37,335 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 14:14:37,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 14:14:37,336 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:14:37,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 115 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:14:37,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 14:14:37,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 14:14:37,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:14:37,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:37,402 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:37,403 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:37,405 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 14:14:37,405 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 14:14:37,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:37,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:37,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-15 14:14:37,406 INFO L87 Difference]: Start difference. First operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Second operand 86 states. [2022-04-15 14:14:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:37,408 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 14:14:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 14:14:37,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:37,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:37,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:14:37,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:14:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 55 states have internal predecessors, (64), 23 states have call successors, (23), 10 states have call predecessors, (23), 9 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-15 14:14:37,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions. [2022-04-15 14:14:37,410 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 47 [2022-04-15 14:14:37,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:14:37,410 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 108 transitions. [2022-04-15 14:14:37,411 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 14:14:37,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 108 transitions. [2022-04-15 14:14:37,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 14:14:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 14:14:37,508 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:37,508 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:14:37,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 14:14:37,708 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 14:14:37,708 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:37,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:37,709 INFO L85 PathProgramCache]: Analyzing trace with hash -589126939, now seen corresponding path program 1 times [2022-04-15 14:14:37,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:37,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556902155]