/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/divbin.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:42:00,939 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:42:00,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:42:00,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:42:00,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:42:00,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:42:00,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:42:00,993 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:42:00,995 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:42:00,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:42:00,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:42:01,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:42:01,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:42:01,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:42:01,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:42:01,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:42:01,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:42:01,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:42:01,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:42:01,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:42:01,015 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:42:01,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:42:01,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:42:01,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:42:01,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:42:01,025 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:42:01,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:42:01,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:42:01,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:42:01,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:42:01,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:42:01,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:42:01,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:42:01,029 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:42:01,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:42:01,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:42:01,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:42:01,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:42:01,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:42:01,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:42:01,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:42:01,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:42:01,034 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:42:01,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:42:01,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:42:01,046 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:42:01,046 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:42:01,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:42:01,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:42:01,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:42:01,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:42:01,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:42:01,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:42:01,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:42:01,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:42:01,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:42:01,048 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:42:01,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:42:01,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:42:01,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:42:01,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:42:01,049 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:42:01,049 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:42:01,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:42:01,049 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:42:01,049 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:42:01,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:42:01,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:42:01,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:42:01,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:42:01,318 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:42:01,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin.i [2022-04-08 10:42:01,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7c31011/7df5e55760fd4cb297554429890bd0db/FLAG8ca289f97 [2022-04-08 10:42:01,732 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:42:01,733 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin.i [2022-04-08 10:42:01,740 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7c31011/7df5e55760fd4cb297554429890bd0db/FLAG8ca289f97 [2022-04-08 10:42:01,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba7c31011/7df5e55760fd4cb297554429890bd0db [2022-04-08 10:42:01,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:42:01,764 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:42:01,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:42:01,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:42:01,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:42:01,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:42:01" (1/1) ... [2022-04-08 10:42:01,772 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ef423fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:01, skipping insertion in model container [2022-04-08 10:42:01,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:42:01" (1/1) ... [2022-04-08 10:42:01,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:42:01,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:42:01,988 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/divbin.i[950,963] [2022-04-08 10:42:02,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:42:02,021 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:42:02,036 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/divbin.i[950,963] [2022-04-08 10:42:02,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:42:02,065 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:42:02,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02 WrapperNode [2022-04-08 10:42:02,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:42:02,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:42:02,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:42:02,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:42:02,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:42:02,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:42:02,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:42:02,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:42:02,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (1/1) ... [2022-04-08 10:42:02,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:42:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:42:02,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:42:02,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:42:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:42:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:42:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:42:02,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:42:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:42:02,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:42:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:42:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:42:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 10:42:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 10:42:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:42:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:42:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 10:42:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:42:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:42:02,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:42:02,276 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:42:02,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:42:02,441 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:42:02,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:42:02,446 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 10:42:02,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:42:02 BoogieIcfgContainer [2022-04-08 10:42:02,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:42:02,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:42:02,449 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:42:02,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:42:02,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:42:01" (1/3) ... [2022-04-08 10:42:02,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52862bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:42:02, skipping insertion in model container [2022-04-08 10:42:02,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:42:02" (2/3) ... [2022-04-08 10:42:02,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52862bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:42:02, skipping insertion in model container [2022-04-08 10:42:02,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:42:02" (3/3) ... [2022-04-08 10:42:02,473 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin.i [2022-04-08 10:42:02,477 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:42:02,477 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:42:02,523 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:42:02,528 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:42:02,528 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:42:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:42:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 10:42:02,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:42:02,566 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:42:02,567 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:42:02,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:42:02,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1345265538, now seen corresponding path program 1 times [2022-04-08 10:42:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [651304663] [2022-04-08 10:42:02,594 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:42:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1345265538, now seen corresponding path program 2 times [2022-04-08 10:42:02,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:42:02,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584662562] [2022-04-08 10:42:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:42:02,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:42:02,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:02,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:42:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:02,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(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); {34#true} is VALID [2022-04-08 10:42:02,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 10:42:02,805 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-08 10:42:02,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:42:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:02,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 10:42:02,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 10:42:02,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 10:42:02,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #79#return; {35#false} is VALID [2022-04-08 10:42:02,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 10:42:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:02,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 10:42:02,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 10:42:02,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 10:42:02,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #81#return; {35#false} is VALID [2022-04-08 10:42:02,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:42:02,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(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); {34#true} is VALID [2022-04-08 10:42:02,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 10:42:02,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #87#return; {34#true} is VALID [2022-04-08 10:42:02,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret3 := main(); {34#true} is VALID [2022-04-08 10:42:02,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {34#true} is VALID [2022-04-08 10:42:02,829 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {34#true} is VALID [2022-04-08 10:42:02,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 10:42:02,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 10:42:02,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 10:42:02,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #79#return; {35#false} is VALID [2022-04-08 10:42:02,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-08 10:42:02,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-08 10:42:02,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-08 10:42:02,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-08 10:42:02,832 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35#false} {35#false} #81#return; {35#false} is VALID [2022-04-08 10:42:02,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {35#false} is VALID [2022-04-08 10:42:02,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-08 10:42:02,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-08 10:42:02,833 INFO L272 TraceCheckUtils]: 19: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {35#false} is VALID [2022-04-08 10:42:02,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 10:42:02,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 10:42:02,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 10:42:02,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:42:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:42:02,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584662562] [2022-04-08 10:42:02,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584662562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:02,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:02,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:42:02,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:42:02,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [651304663] [2022-04-08 10:42:02,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [651304663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:02,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:02,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:42:02,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849285488] [2022-04-08 10:42:02,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:42:02,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 10:42:02,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:42:02,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:42:02,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:02,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:42:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:02,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:42:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:42:02,910 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:42:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:03,056 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-08 10:42:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:42:03,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-08 10:42:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:42:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:42:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-08 10:42:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:42:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-08 10:42:03,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-08 10:42:03,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:03,197 INFO L225 Difference]: With dead ends: 55 [2022-04-08 10:42:03,197 INFO L226 Difference]: Without dead ends: 26 [2022-04-08 10:42:03,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:42:03,202 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:42:03,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:42:03,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-08 10:42:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-08 10:42:03,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:42:03,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:42:03,240 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:42:03,242 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:42:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:03,250 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 10:42:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 10:42:03,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:03,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:03,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 10:42:03,252 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-08 10:42:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:03,254 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-08 10:42:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 10:42:03,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:03,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:03,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:42:03,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:42:03,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:42:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-08 10:42:03,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 23 [2022-04-08 10:42:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:42:03,259 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-08 10:42:03,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:42:03,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-08 10:42:03,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-08 10:42:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 10:42:03,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:42:03,306 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:42:03,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:42:03,306 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:42:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:42:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1801528411, now seen corresponding path program 1 times [2022-04-08 10:42:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:03,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1728586782] [2022-04-08 10:42:03,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:42:03,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1801528411, now seen corresponding path program 2 times [2022-04-08 10:42:03,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:42:03,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160684939] [2022-04-08 10:42:03,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:42:03,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:42:03,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:42:03,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000591752] [2022-04-08 10:42:03,361 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:42:03,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:03,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:42:03,363 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:42:03,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:42:03,425 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:42:03,425 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:42:03,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:42:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:03,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:42:04,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {264#true} is VALID [2022-04-08 10:42:04,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#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); {264#true} is VALID [2022-04-08 10:42:04,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:42:04,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #87#return; {264#true} is VALID [2022-04-08 10:42:04,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret3 := main(); {264#true} is VALID [2022-04-08 10:42:04,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {264#true} is VALID [2022-04-08 10:42:04,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {264#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {264#true} is VALID [2022-04-08 10:42:04,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#true} ~cond := #in~cond; {264#true} is VALID [2022-04-08 10:42:04,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#true} assume !(0 == ~cond); {264#true} is VALID [2022-04-08 10:42:04,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:42:04,035 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {264#true} {264#true} #79#return; {264#true} is VALID [2022-04-08 10:42:04,035 INFO L272 TraceCheckUtils]: 11: Hoare triple {264#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {264#true} is VALID [2022-04-08 10:42:04,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {264#true} ~cond := #in~cond; {264#true} is VALID [2022-04-08 10:42:04,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {264#true} assume !(0 == ~cond); {264#true} is VALID [2022-04-08 10:42:04,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {264#true} assume true; {264#true} is VALID [2022-04-08 10:42:04,036 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {264#true} {264#true} #81#return; {264#true} is VALID [2022-04-08 10:42:04,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {317#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:04,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {317#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {317#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:04,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {317#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {324#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:04,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {324#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {324#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 10:42:04,040 INFO L272 TraceCheckUtils]: 20: Hoare triple {324#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= 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)); {331#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:42:04,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {331#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {335#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:42:04,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {335#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {265#false} is VALID [2022-04-08 10:42:04,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {265#false} assume !false; {265#false} is VALID [2022-04-08 10:42:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:42:04,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:42:04,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:42:04,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160684939] [2022-04-08 10:42:04,042 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:42:04,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000591752] [2022-04-08 10:42:04,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000591752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:04,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:04,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:42:04,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:42:04,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1728586782] [2022-04-08 10:42:04,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1728586782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:04,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:04,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 10:42:04,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558611950] [2022-04-08 10:42:04,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:42:04,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-08 10:42:04,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:42:04,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:42:04,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:04,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 10:42:04,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 10:42:04,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:42:04,067 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:42:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:04,256 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 10:42:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:42:04,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-08 10:42:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:42:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:42:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 10:42:04,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:42:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-08 10:42:04,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-08 10:42:04,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:04,311 INFO L225 Difference]: With dead ends: 37 [2022-04-08 10:42:04,311 INFO L226 Difference]: Without dead ends: 34 [2022-04-08 10:42:04,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 10:42:04,314 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 11 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 10:42:04,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 10:42:04,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-08 10:42:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-08 10:42:04,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:42:04,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:04,342 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:04,344 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:04,346 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 10:42:04,346 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 10:42:04,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:04,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:04,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 10:42:04,348 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 34 states. [2022-04-08 10:42:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:04,350 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-08 10:42:04,350 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 10:42:04,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:04,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:04,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:42:04,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:42:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2022-04-08 10:42:04,353 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 24 [2022-04-08 10:42:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:42:04,354 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2022-04-08 10:42:04,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:42:04,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 39 transitions. [2022-04-08 10:42:04,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:04,407 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2022-04-08 10:42:04,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 10:42:04,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:42:04,409 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:42:04,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 10:42:04,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:04,612 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:42:04,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:42:04,612 INFO L85 PathProgramCache]: Analyzing trace with hash 96987309, now seen corresponding path program 1 times [2022-04-08 10:42:04,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:04,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841816491] [2022-04-08 10:42:04,613 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:42:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash 96987309, now seen corresponding path program 2 times [2022-04-08 10:42:04,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:42:04,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753196526] [2022-04-08 10:42:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:42:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:42:04,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:42:04,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670063419] [2022-04-08 10:42:04,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:42:04,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:04,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:42:04,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:42:04,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:42:04,671 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:42:04,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:42:04,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-08 10:42:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:42:04,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:42:04,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {553#true} call ULTIMATE.init(); {553#true} is VALID [2022-04-08 10:42:04,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#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); {553#true} is VALID [2022-04-08 10:42:04,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {553#true} assume true; {553#true} is VALID [2022-04-08 10:42:04,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {553#true} {553#true} #87#return; {553#true} is VALID [2022-04-08 10:42:04,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {553#true} call #t~ret3 := main(); {553#true} is VALID [2022-04-08 10:42:04,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {553#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {553#true} is VALID [2022-04-08 10:42:04,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {553#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {553#true} is VALID [2022-04-08 10:42:04,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#true} ~cond := #in~cond; {553#true} is VALID [2022-04-08 10:42:04,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {553#true} assume !(0 == ~cond); {553#true} is VALID [2022-04-08 10:42:04,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {553#true} assume true; {553#true} is VALID [2022-04-08 10:42:04,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {553#true} {553#true} #79#return; {553#true} is VALID [2022-04-08 10:42:04,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {553#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {553#true} is VALID [2022-04-08 10:42:04,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {553#true} ~cond := #in~cond; {553#true} is VALID [2022-04-08 10:42:04,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {553#true} assume !(0 == ~cond); {553#true} is VALID [2022-04-08 10:42:04,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {553#true} assume true; {553#true} is VALID [2022-04-08 10:42:04,753 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {553#true} {553#true} #81#return; {553#true} is VALID [2022-04-08 10:42:04,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {553#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {606#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 10:42:04,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {606#(= main_~B~0 main_~b~0)} assume !false; {606#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 10:42:04,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {606#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {606#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 10:42:04,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {606#(= main_~B~0 main_~b~0)} assume !false; {606#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 10:42:04,755 INFO L272 TraceCheckUtils]: 20: Hoare triple {606#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {553#true} is VALID [2022-04-08 10:42:04,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {553#true} ~cond := #in~cond; {553#true} is VALID [2022-04-08 10:42:04,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {553#true} assume !(0 == ~cond); {553#true} is VALID [2022-04-08 10:42:04,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {553#true} assume true; {553#true} is VALID [2022-04-08 10:42:04,756 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {553#true} {606#(= main_~B~0 main_~b~0)} #83#return; {606#(= main_~B~0 main_~b~0)} is VALID [2022-04-08 10:42:04,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {606#(= 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); {554#false} is VALID [2022-04-08 10:42:04,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {554#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {554#false} is VALID [2022-04-08 10:42:04,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {554#false} assume !false; {554#false} is VALID [2022-04-08 10:42:04,759 INFO L272 TraceCheckUtils]: 28: Hoare triple {554#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {554#false} is VALID [2022-04-08 10:42:04,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {554#false} ~cond := #in~cond; {554#false} is VALID [2022-04-08 10:42:04,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {554#false} assume 0 == ~cond; {554#false} is VALID [2022-04-08 10:42:04,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {554#false} assume !false; {554#false} is VALID [2022-04-08 10:42:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:42:04,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:42:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:42:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753196526] [2022-04-08 10:42:04,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:42:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670063419] [2022-04-08 10:42:04,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670063419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:04,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:04,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:42:04,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:42:04,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [841816491] [2022-04-08 10:42:04,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [841816491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:42:04,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:42:04,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:42:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95875720] [2022-04-08 10:42:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:42:04,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 10:42:04,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:42:04,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:42:04,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:04,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:42:04,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:42:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:42:04,788 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:42:06,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:06,929 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-04-08 10:42:06,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:42:06,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2022-04-08 10:42:06,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:42:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:42:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 10:42:06,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:42:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-08 10:42:06,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-08 10:42:06,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:06,999 INFO L225 Difference]: With dead ends: 58 [2022-04-08 10:42:06,999 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 10:42:06,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:42:07,000 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:42:07,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:42:07,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 10:42:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-08 10:42:07,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:42:07,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:07,012 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:07,012 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:07,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:07,014 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 10:42:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 10:42:07,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:07,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:07,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-08 10:42:07,015 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 36 states. [2022-04-08 10:42:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:42:07,017 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 10:42:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 10:42:07,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:42:07,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:42:07,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:42:07,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:42:07,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:42:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-08 10:42:07,025 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 32 [2022-04-08 10:42:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:42:07,025 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-08 10:42:07,025 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 10:42:07,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 41 transitions. [2022-04-08 10:42:07,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:42:07,088 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 10:42:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 10:42:07,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:42:07,089 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:42:07,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:42:07,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:42:07,290 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:42:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:42:07,291 INFO L85 PathProgramCache]: Analyzing trace with hash 852542504, now seen corresponding path program 1 times [2022-04-08 10:42:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:42:07,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2132202823] [2022-04-08 10:42:07,291 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:42:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 852542504, now seen corresponding path program 2 times [2022-04-08 10:42:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:42:07,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895242227] [2022-04-08 10:42:07,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:42:07,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:42:07,311 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:42:07,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [304706445] [2022-04-08 10:42:07,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:42:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:42:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:42:07,313 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:42:07,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process