/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/divbin_valuebound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:28:50,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:28:50,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:28:50,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:28:50,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:28:50,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:28:50,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:28:50,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:28:50,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:28:50,542 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:28:50,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:28:50,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:28:50,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:28:50,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:28:50,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:28:50,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:28:50,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:28:50,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:28:50,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:28:50,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:28:50,564 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:28:50,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:28:50,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:28:50,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:28:50,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:28:50,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:28:50,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:28:50,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:28:50,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:28:50,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:28:50,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:28:50,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:28:50,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:28:50,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:28:50,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:28:50,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:28:50,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:28:50,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:28:50,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:28:50,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:28:50,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:28:50,592 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:28:50,593 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:28:50,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:28:50,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:28:50,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:28:50,606 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:28:50,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:28:50,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:28:50,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:28:50,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:28:50,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:28:50,608 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:28:50,608 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:28:50,608 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:28:50,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:28:50,609 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:28:50,609 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:28:50,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:28:50,609 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:28:50,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:28:50,609 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:28:50,610 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:28:50,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:28:50,610 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:28:50,610 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:28:50,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:28:50,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:28:50,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:28:50,891 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:28:50,892 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:28:50,893 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound1.i [2022-04-15 14:28:50,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c391a22a/91111dd8312a4258b13c65d0954f83d2/FLAG624edb4a6 [2022-04-15 14:28:51,336 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:28:51,337 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound1.i [2022-04-15 14:28:51,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c391a22a/91111dd8312a4258b13c65d0954f83d2/FLAG624edb4a6 [2022-04-15 14:28:51,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c391a22a/91111dd8312a4258b13c65d0954f83d2 [2022-04-15 14:28:51,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:28:51,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:28:51,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:28:51,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:28:51,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:28:51,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402ba2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51, skipping insertion in model container [2022-04-15 14:28:51,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:28:51,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:28:51,536 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/divbin_valuebound1.i[950,963] [2022-04-15 14:28:51,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:28:51,559 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:28:51,570 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/divbin_valuebound1.i[950,963] [2022-04-15 14:28:51,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:28:51,590 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:28:51,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51 WrapperNode [2022-04-15 14:28:51,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:28:51,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:28:51,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:28:51,591 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:28:51,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:28:51,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:28:51,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:28:51,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:28:51,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (1/1) ... [2022-04-15 14:28:51,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:28:51,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:28:51,653 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:28:51,657 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:28:51,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:28:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:28:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:28:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:28:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:28:51,702 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:28:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:28:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:28:51,702 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:28:51,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:28:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:28:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:28:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:28:51,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:28:51,763 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:28:51,764 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:28:51,887 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:28:51,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:28:51,893 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:28:51,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:28:51 BoogieIcfgContainer [2022-04-15 14:28:51,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:28:51,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:28:51,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:28:51,908 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:28:51,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:28:51" (1/3) ... [2022-04-15 14:28:51,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45057784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:28:51, skipping insertion in model container [2022-04-15 14:28:51,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:28:51" (2/3) ... [2022-04-15 14:28:51,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45057784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:28:51, skipping insertion in model container [2022-04-15 14:28:51,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:28:51" (3/3) ... [2022-04-15 14:28:51,911 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound1.i [2022-04-15 14:28:51,916 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:28:51,917 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:28:51,954 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:28:51,964 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:28:51,964 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:28:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 14:28:51,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:28:51,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:28:51,989 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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:28:51,989 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:28:51,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:28:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 1 times [2022-04-15 14:28:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:52,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1337241884] [2022-04-15 14:28:52,012 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:28:52,012 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 2 times [2022-04-15 14:28:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:28:52,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722975130] [2022-04-15 14:28:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:28:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:28:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:28:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:52,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37#true} is VALID [2022-04-15 14:28:52,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 14:28:52,213 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-15 14:28:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:28:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:52,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-15 14:28:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 14:28:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:52,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-15 14:28:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 14:28:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:52,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-15 14:28:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 14:28:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:52,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-15 14:28:52,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:28:52,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {37#true} is VALID [2022-04-15 14:28:52,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-15 14:28:52,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-15 14:28:52,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2022-04-15 14:28:52,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2022-04-15 14:28:52,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-15 14:28:52,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-15 14:28:52,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} ~B~0 := #t~nondet2;havoc #t~nondet2; {38#false} is VALID [2022-04-15 14:28:52,286 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {37#true} is VALID [2022-04-15 14:28:52,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,287 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-15 14:28:52,287 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {37#true} is VALID [2022-04-15 14:28:52,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,301 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-15 14:28:52,301 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-15 14:28:52,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-15 14:28:52,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-15 14:28:52,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-15 14:28:52,302 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-15 14:28:52,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {38#false} is VALID [2022-04-15 14:28:52,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-15 14:28:52,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-15 14:28:52,303 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {38#false} is VALID [2022-04-15 14:28:52,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-15 14:28:52,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-15 14:28:52,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-15 14:28:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:28:52,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:28:52,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722975130] [2022-04-15 14:28:52,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722975130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:28:52,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:28:52,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:28:52,308 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:28:52,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1337241884] [2022-04-15 14:28:52,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1337241884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:28:52,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:28:52,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:28:52,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991153616] [2022-04-15 14:28:52,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:28:52,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:28:52,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:28:52,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:28:52,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:52,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:28:52,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:28:52,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:28:52,389 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:28:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:52,552 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-15 14:28:52,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:28:52,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:28:52,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:28:52,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:28:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-15 14:28:52,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:28:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-15 14:28:52,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-15 14:28:52,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:52,701 INFO L225 Difference]: With dead ends: 61 [2022-04-15 14:28:52,702 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 14:28:52,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:28:52,713 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:28:52,715 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:28:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 14:28:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 14:28:52,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:28:52,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:28:52,758 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:28:52,759 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:28:52,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:52,776 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:28:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:28:52,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:28:52,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:28:52,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 14:28:52,778 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-15 14:28:52,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:52,782 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:28:52,782 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:28:52,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:28:52,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:28:52,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:28:52,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:28:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:28:52,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-15 14:28:52,787 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-15 14:28:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:28:52,787 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-15 14:28:52,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:28:52,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-15 14:28:52,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:52,832 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:28:52,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 14:28:52,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:28:52,835 INFO L499 BasicCegarLoop]: trace histogram [4, 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] [2022-04-15 14:28:52,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:28:52,836 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:28:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:28:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 1 times [2022-04-15 14:28:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1932355251] [2022-04-15 14:28:52,849 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:28:52,849 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 2 times [2022-04-15 14:28:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:28:52,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737751291] [2022-04-15 14:28:52,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:28:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:28:52,906 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:28:52,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1554295280] [2022-04-15 14:28:52,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:28:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:28:52,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:28:52,915 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:28:52,925 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:28:53,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:28:53,016 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:28:53,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:28:53,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:53,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:28:53,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {299#true} call ULTIMATE.init(); {299#true} is VALID [2022-04-15 14:28:53,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {299#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {299#true} is VALID [2022-04-15 14:28:53,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-15 14:28:53,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {299#true} {299#true} #94#return; {299#true} is VALID [2022-04-15 14:28:53,299 INFO L272 TraceCheckUtils]: 4: Hoare triple {299#true} call #t~ret3 := main(); {299#true} is VALID [2022-04-15 14:28:53,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {299#true} is VALID [2022-04-15 14:28:53,301 INFO L272 TraceCheckUtils]: 6: Hoare triple {299#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {299#true} is VALID [2022-04-15 14:28:53,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-15 14:28:53,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-15 14:28:53,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-15 14:28:53,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {299#true} {299#true} #82#return; {299#true} is VALID [2022-04-15 14:28:53,302 INFO L290 TraceCheckUtils]: 11: Hoare triple {299#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {299#true} is VALID [2022-04-15 14:28:53,302 INFO L272 TraceCheckUtils]: 12: Hoare triple {299#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {299#true} is VALID [2022-04-15 14:28:53,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-15 14:28:53,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-15 14:28:53,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-15 14:28:53,304 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {299#true} {299#true} #84#return; {299#true} is VALID [2022-04-15 14:28:53,304 INFO L272 TraceCheckUtils]: 17: Hoare triple {299#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {299#true} is VALID [2022-04-15 14:28:53,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-15 14:28:53,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-15 14:28:53,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-15 14:28:53,309 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {299#true} {299#true} #86#return; {299#true} is VALID [2022-04-15 14:28:53,310 INFO L272 TraceCheckUtils]: 22: Hoare triple {299#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {299#true} is VALID [2022-04-15 14:28:53,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {299#true} ~cond := #in~cond; {299#true} is VALID [2022-04-15 14:28:53,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {299#true} assume !(0 == ~cond); {299#true} is VALID [2022-04-15 14:28:53,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {299#true} assume true; {299#true} is VALID [2022-04-15 14:28:53,312 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {299#true} {299#true} #88#return; {299#true} is VALID [2022-04-15 14:28:53,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {299#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:28:53,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:28:53,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:28:53,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:28:53,317 INFO L272 TraceCheckUtils]: 31: Hoare triple {385#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {398#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:28:53,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {398#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {402#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:28:53,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {402#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {300#false} is VALID [2022-04-15 14:28:53,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {300#false} assume !false; {300#false} is VALID [2022-04-15 14:28:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:28:53,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:28:53,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:28:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737751291] [2022-04-15 14:28:53,320 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:28:53,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554295280] [2022-04-15 14:28:53,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554295280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:28:53,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:28:53,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:28:53,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:28:53,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1932355251] [2022-04-15 14:28:53,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1932355251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:28:53,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:28:53,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:28:53,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835723477] [2022-04-15 14:28:53,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:28:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-15 14:28:53,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:28:53,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:28:53,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:53,358 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:28:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:28:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:28:53,361 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:28:53,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:53,546 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-15 14:28:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:28:53,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-15 14:28:53,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:28:53,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:28:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:28:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:28:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:28:53,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 14:28:53,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:53,615 INFO L225 Difference]: With dead ends: 40 [2022-04-15 14:28:53,615 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 14:28:53,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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:28:53,618 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:28:53,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 102 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:28:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 14:28:53,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 14:28:53,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:28:53,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:53,633 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:53,634 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:53,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:53,637 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 14:28:53,637 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 14:28:53,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:28:53,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:28:53,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-15 14:28:53,638 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-15 14:28:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:53,641 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 14:28:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 14:28:53,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:28:53,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:28:53,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:28:53,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:28:53,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-04-15 14:28:53,644 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 35 [2022-04-15 14:28:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:28:53,645 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-04-15 14:28:53,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 14:28:53,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 44 transitions. [2022-04-15 14:28:53,703 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:28:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-15 14:28:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 14:28:53,705 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:28:53,705 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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:28:53,731 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:28:53,929 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:28:53,930 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:28:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:28:53,931 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 1 times [2022-04-15 14:28:53,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:53,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [976660828] [2022-04-15 14:28:53,932 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:28:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 2 times [2022-04-15 14:28:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:28:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579039098] [2022-04-15 14:28:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:28:53,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:28:53,964 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:28:53,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1126352347] [2022-04-15 14:28:53,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:28:53,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:28:53,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:28:53,966 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:28:53,970 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:28:54,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:28:54,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:28:54,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 14:28:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:28:54,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:28:54,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {638#true} call ULTIMATE.init(); {638#true} is VALID [2022-04-15 14:28:54,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {638#true} is VALID [2022-04-15 14:28:54,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {638#true} assume true; {638#true} is VALID [2022-04-15 14:28:54,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {638#true} {638#true} #94#return; {638#true} is VALID [2022-04-15 14:28:54,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {638#true} call #t~ret3 := main(); {638#true} is VALID [2022-04-15 14:28:54,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {638#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {638#true} is VALID [2022-04-15 14:28:54,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {638#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {638#true} is VALID [2022-04-15 14:28:54,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {638#true} ~cond := #in~cond; {638#true} is VALID [2022-04-15 14:28:54,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {638#true} assume !(0 == ~cond); {638#true} is VALID [2022-04-15 14:28:54,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#true} assume true; {638#true} is VALID [2022-04-15 14:28:54,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {638#true} {638#true} #82#return; {638#true} is VALID [2022-04-15 14:28:54,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {638#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {638#true} is VALID [2022-04-15 14:28:54,132 INFO L272 TraceCheckUtils]: 12: Hoare triple {638#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 1 then 1 else 0)); {638#true} is VALID [2022-04-15 14:28:54,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {638#true} ~cond := #in~cond; {638#true} is VALID [2022-04-15 14:28:54,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {638#true} assume !(0 == ~cond); {638#true} is VALID [2022-04-15 14:28:54,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {638#true} assume true; {638#true} is VALID [2022-04-15 14:28:54,133 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {638#true} {638#true} #84#return; {638#true} is VALID [2022-04-15 14:28:54,133 INFO L272 TraceCheckUtils]: 17: Hoare triple {638#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {638#true} is VALID [2022-04-15 14:28:54,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {638#true} ~cond := #in~cond; {638#true} is VALID [2022-04-15 14:28:54,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {638#true} assume !(0 == ~cond); {638#true} is VALID [2022-04-15 14:28:54,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {638#true} assume true; {638#true} is VALID [2022-04-15 14:28:54,134 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {638#true} {638#true} #86#return; {638#true} is VALID [2022-04-15 14:28:54,134 INFO L272 TraceCheckUtils]: 22: Hoare triple {638#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {638#true} is VALID [2022-04-15 14:28:54,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {638#true} ~cond := #in~cond; {638#true} is VALID [2022-04-15 14:28:54,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {638#true} assume !(0 == ~cond); {638#true} is VALID [2022-04-15 14:28:54,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {638#true} assume true; {638#true} is VALID [2022-04-15 14:28:54,135 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {638#true} {638#true} #88#return; {638#true} is VALID [2022-04-15 14:28:54,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {638#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {724#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:28:54,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {724#(= main_~B~0 main_~b~0)} assume !false; {724#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:28:54,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {724#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {724#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:28:54,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {724#(= main_~B~0 main_~b~0)} assume !false; {724#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:28:54,137 INFO L272 TraceCheckUtils]: 31: Hoare triple {724#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {638#true} is VALID [2022-04-15 14:28:54,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {638#true} ~cond := #in~cond; {638#true} is VALID [2022-04-15 14:28:54,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {638#true} assume !(0 == ~cond); {638#true} is VALID [2022-04-15 14:28:54,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {638#true} assume true; {638#true} is VALID [2022-04-15 14:28:54,138 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {638#true} {724#(= main_~B~0 main_~b~0)} #90#return; {724#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:28:54,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {724#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {639#false} is VALID [2022-04-15 14:28:54,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {639#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {639#false} is VALID [2022-04-15 14:28:54,139 INFO L290 TraceCheckUtils]: 38: Hoare triple {639#false} assume !false; {639#false} is VALID [2022-04-15 14:28:54,139 INFO L272 TraceCheckUtils]: 39: Hoare triple {639#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {639#false} is VALID [2022-04-15 14:28:54,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {639#false} ~cond := #in~cond; {639#false} is VALID [2022-04-15 14:28:54,140 INFO L290 TraceCheckUtils]: 41: Hoare triple {639#false} assume 0 == ~cond; {639#false} is VALID [2022-04-15 14:28:54,140 INFO L290 TraceCheckUtils]: 42: Hoare triple {639#false} assume !false; {639#false} is VALID [2022-04-15 14:28:54,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:28:54,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:28:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:28:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579039098] [2022-04-15 14:28:54,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:28:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126352347] [2022-04-15 14:28:54,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126352347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:28:54,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:28:54,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:28:54,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:28:54,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [976660828] [2022-04-15 14:28:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [976660828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:28:54,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:28:54,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:28:54,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968564835] [2022-04-15 14:28:54,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:28:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-15 14:28:54,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:28:54,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:28:54,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:54,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:28:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:54,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:28:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:28:54,170 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:28:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:54,234 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 14:28:54,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:28:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-15 14:28:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:28:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:28:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 14:28:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:28:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-15 14:28:54,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-15 14:28:54,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:54,286 INFO L225 Difference]: With dead ends: 61 [2022-04-15 14:28:54,286 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 14:28:54,287 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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:28:54,288 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:28:54,288 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:28:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 14:28:54,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 14:28:54,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:28:54,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:54,302 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:54,302 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:54,304 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-15 14:28:54,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 14:28:54,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:28:54,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:28:54,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-15 14:28:54,306 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-15 14:28:54,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:28:54,308 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-15 14:28:54,308 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 14:28:54,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:28:54,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:28:54,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:28:54,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:28:54,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 14:28:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-15 14:28:54,311 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 43 [2022-04-15 14:28:54,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:28:54,312 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-15 14:28:54,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-15 14:28:54,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-15 14:28:54,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:28:54,363 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 14:28:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 14:28:54,364 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:28:54,365 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 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:28:54,389 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:28:54,579 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:28:54,580 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:28:54,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:28:54,580 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 1 times [2022-04-15 14:28:54,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:28:54,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1063404417] [2022-04-15 14:28:54,581 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:28:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 2 times [2022-04-15 14:28:54,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:28:54,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172980446] [2022-04-15 14:28:54,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:28:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:28:54,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:28:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2024865814] [2022-04-15 14:28:54,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:28:54,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:28:54,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:28:54,619 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:28:54,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process