/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/dijkstra-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:14:00,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:14:00,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:14:00,959 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:14:00,960 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:14:00,961 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:14:00,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:14:00,966 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:14:00,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:14:00,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:14:00,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:14:00,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:14:00,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:14:00,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:14:00,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:14:00,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:14:00,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:14:00,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:14:00,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:14:00,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:14:00,988 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:14:00,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:14:00,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:14:00,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:14:00,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:14:00,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:14:00,998 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:14:00,998 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:14:00,999 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:14:00,999 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:14:01,000 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:14:01,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:14:01,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:14:01,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:14:01,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:14:01,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:14:01,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:14:01,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:14:01,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:14:01,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:14:01,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:14:01,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:14:01,008 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:14:01,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:14:01,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:14:01,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:14:01,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:14:01,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:14:01,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:14:01,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:14:01,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:14:01,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:14:01,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:14:01,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:14:01,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:14:01,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:14:01,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:14:01,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:14:01,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:14:01,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:14:01,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:14:01,020 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:14:01,020 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:14:01,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:14:01,021 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:14:01,021 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:14:01,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:14:01,268 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:14:01,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:14:01,271 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:14:01,273 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:14:01,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-15 14:14:01,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cef3b11/453f09c94d9b422ba91d200a3d8fbc5b/FLAG67b31627f [2022-04-15 14:14:01,699 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:14:01,699 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound5.c [2022-04-15 14:14:01,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cef3b11/453f09c94d9b422ba91d200a3d8fbc5b/FLAG67b31627f [2022-04-15 14:14:01,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cef3b11/453f09c94d9b422ba91d200a3d8fbc5b [2022-04-15 14:14:01,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:14:01,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:14:01,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:14:01,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:14:01,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:14:01,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:14:01" (1/1) ... [2022-04-15 14:14:01,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d10457c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:01, skipping insertion in model container [2022-04-15 14:14:01,742 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:14:01" (1/1) ... [2022-04-15 14:14:01,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:14:01,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:14:01,923 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/dijkstra-u_valuebound5.c[525,538] [2022-04-15 14:14:01,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:14:01,982 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:14:01,997 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/dijkstra-u_valuebound5.c[525,538] [2022-04-15 14:14:02,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:14:02,043 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:14:02,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02 WrapperNode [2022-04-15 14:14:02,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:14:02,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:14:02,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:14:02,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:14:02,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,070 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,070 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:14:02,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:14:02,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:14:02,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:14:02,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (1/1) ... [2022-04-15 14:14:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:14:02,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:14:02,120 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:14:02,133 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:14:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:14:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:14:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:14:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:14:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:14:02,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:14:02,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:14:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:14:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:14:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:14:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:14:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:14:02,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:14:02,204 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:14:02,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:14:02,482 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:14:02,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:14:02,488 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:14:02,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:14:02 BoogieIcfgContainer [2022-04-15 14:14:02,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:14:02,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:14:02,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:14:02,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:14:02,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:14:01" (1/3) ... [2022-04-15 14:14:02,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3997ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:14:02, skipping insertion in model container [2022-04-15 14:14:02,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:14:02" (2/3) ... [2022-04-15 14:14:02,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a3997ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:14:02, skipping insertion in model container [2022-04-15 14:14:02,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:14:02" (3/3) ... [2022-04-15 14:14:02,508 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound5.c [2022-04-15 14:14:02,512 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:14:02,512 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:14:02,558 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:14:02,565 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:14:02,565 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:14:02,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 14:14:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:14:02,588 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:02,589 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-15 14:14:02,590 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-15 14:14:02,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:02,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338114105] [2022-04-15 14:14:02,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:14:02,614 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 2 times [2022-04-15 14:14:02,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:02,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608859259] [2022-04-15 14:14:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:02,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:14:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:02,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-15 14:14:02,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:14:02,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 14:14:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:14:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:02,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:14:02,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:14:02,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:14:02,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 14:14:02,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:14:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:02,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:14:02,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:14:02,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:14:02,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 14:14:02,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:14:02,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-15 14:14:02,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-15 14:14:02,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-15 14:14:02,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-15 14:14:02,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-15 14:14:02,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {41#true} is VALID [2022-04-15 14:14:02,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:14:02,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:14:02,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:14:02,843 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-15 14:14:02,843 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-15 14:14:02,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-15 14:14:02,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-15 14:14:02,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-15 14:14:02,845 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-15 14:14:02,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-15 14:14:02,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 14:14:02,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-15 14:14:02,846 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-15 14:14:02,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-15 14:14:02,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-15 14:14:02,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-15 14:14:02,847 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-15 14:14:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:02,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608859259] [2022-04-15 14:14:02,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608859259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:02,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:02,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:14:02,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:02,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338114105] [2022-04-15 14:14:02,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338114105] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:02,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:02,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:14:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83517215] [2022-04-15 14:14:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:02,856 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-15 14:14:02,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:02,861 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-15 14:14:02,897 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-15 14:14:02,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:14:02,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:14:02,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:14:02,922 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 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-15 14:14:10,140 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:10,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:10,585 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-15 14:14:10,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:14:10,585 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-15 14:14:10,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:14:10,586 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-15 14:14:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 14:14:10,596 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-15 14:14:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-15 14:14:10,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-15 14:14:10,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:10,740 INFO L225 Difference]: With dead ends: 69 [2022-04-15 14:14:10,740 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 14:14:10,743 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-15 14:14:10,745 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:14:10,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 14:14:10,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 14:14:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 14:14:10,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:14:10,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:14:10,774 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:14:10,774 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:14:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:10,779 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 14:14:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:14:10,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:10,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:10,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-15 14:14:10,781 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-15 14:14:10,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:10,784 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-15 14:14:10,784 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:14:10,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:10,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:10,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:14:10,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:14:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 14:14:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-15 14:14:10,790 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-15 14:14:10,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:14:10,790 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-15 14:14:10,790 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-15 14:14:10,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 44 transitions. [2022-04-15 14:14:10,844 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:14:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-15 14:14:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 14:14:10,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:10,846 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-15 14:14:10,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:14:10,846 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-15 14:14:10,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [464082563] [2022-04-15 14:14:10,848 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:14:10,848 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 2 times [2022-04-15 14:14:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:10,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854559415] [2022-04-15 14:14:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:10,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:11,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:14:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:11,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(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(13, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-15 14:14:11,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:14:11,096 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 14:14:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:14:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:11,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:14:11,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:14:11,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:14:11,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 14:14:11,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:14:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:11,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:14:11,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:14:11,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:14:11,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 14:14:11,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {327#true} call ULTIMATE.init(); {344#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:14:11,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#(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(13, 2);call #Ultimate.allocInit(12, 3); {327#true} is VALID [2022-04-15 14:14:11,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:14:11,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {327#true} {327#true} #103#return; {327#true} is VALID [2022-04-15 14:14:11,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {327#true} call #t~ret5 := main(); {327#true} is VALID [2022-04-15 14:14:11,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {327#true} is VALID [2022-04-15 14:14:11,110 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {327#true} is VALID [2022-04-15 14:14:11,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:14:11,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:14:11,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:14:11,111 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {327#true} {327#true} #81#return; {327#true} is VALID [2022-04-15 14:14:11,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {327#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {327#true} is VALID [2022-04-15 14:14:11,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} ~cond := #in~cond; {327#true} is VALID [2022-04-15 14:14:11,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} assume !(0 == ~cond); {327#true} is VALID [2022-04-15 14:14:11,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume true; {327#true} is VALID [2022-04-15 14:14:11,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {327#true} {327#true} #83#return; {327#true} is VALID [2022-04-15 14:14:11,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:11,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:11,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {340#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 14:14:11,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !false; {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-15 14:14:11,117 INFO L272 TraceCheckUtils]: 20: Hoare triple {341#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {342#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:14:11,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {342#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {343#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:14:11,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {343#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {328#false} is VALID [2022-04-15 14:14:11,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {328#false} assume !false; {328#false} is VALID [2022-04-15 14:14:11,118 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-15 14:14:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854559415] [2022-04-15 14:14:11,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854559415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:11,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:11,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:14:11,120 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [464082563] [2022-04-15 14:14:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [464082563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:11,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:11,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:14:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023977440] [2022-04-15 14:14:11,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:11,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:11,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:11,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:11,147 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:14:11,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:11,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:14:11,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:14:11,148 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:15,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:17,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:19,128 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:22,837 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:29,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:30,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:30,331 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-15 14:14:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:14:30,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:14:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-15 14:14:30,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-15 14:14:30,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-15 14:14:30,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:30,555 INFO L225 Difference]: With dead ends: 68 [2022-04-15 14:14:30,555 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 14:14:30,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:14:30,557 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 34 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 50 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2022-04-15 14:14:30,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 56 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 203 Invalid, 5 Unknown, 0 Unchecked, 14.8s Time] [2022-04-15 14:14:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 14:14:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 14:14:30,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:14:30,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:14:30,577 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:14:30,578 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:14:30,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:30,582 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 14:14:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-15 14:14:30,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:30,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:30,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-15 14:14:30,584 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-15 14:14:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:30,588 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-15 14:14:30,588 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-15 14:14:30,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:30,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:30,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:14:30,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:14:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 14:14:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-15 14:14:30,593 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-15 14:14:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:14:30,593 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-15 14:14:30,593 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 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-15 14:14:30,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 65 transitions. [2022-04-15 14:14:30,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-15 14:14:30,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:14:30,801 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:30,801 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:14:30,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 14:14:30,802 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:30,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:30,802 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-15 14:14:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:30,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [772490660] [2022-04-15 14:14:30,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:14:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 2 times [2022-04-15 14:14:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:30,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202335251] [2022-04-15 14:14:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:14:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:30,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#(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(13, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-15 14:14:30,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-15 14:14:30,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-15 14:14:30,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:14:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:30,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-15 14:14:30,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-15 14:14:30,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-15 14:14:30,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-15 14:14:30,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:14:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:30,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-15 14:14:30,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-15 14:14:30,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-15 14:14:30,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-15 14:14:30,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:14:30,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#(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(13, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-15 14:14:30,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-15 14:14:30,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #103#return; {685#true} is VALID [2022-04-15 14:14:30,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret5 := main(); {685#true} is VALID [2022-04-15 14:14:30,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {685#true} is VALID [2022-04-15 14:14:30,970 INFO L272 TraceCheckUtils]: 6: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {685#true} is VALID [2022-04-15 14:14:30,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-15 14:14:30,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-15 14:14:30,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-15 14:14:30,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {685#true} {685#true} #81#return; {685#true} is VALID [2022-04-15 14:14:30,972 INFO L272 TraceCheckUtils]: 11: Hoare triple {685#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {685#true} is VALID [2022-04-15 14:14:30,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-15 14:14:30,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-15 14:14:30,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-15 14:14:30,973 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {685#true} {685#true} #83#return; {685#true} is VALID [2022-04-15 14:14:30,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {685#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:14:30,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:14:30,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:14:30,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !false; {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-15 14:14:30,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {699#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 14:14:30,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {699#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !false; {699#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-15 14:14:30,980 INFO L272 TraceCheckUtils]: 22: Hoare triple {699#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {700#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 14:14:30,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {700#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {701#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 14:14:30,981 INFO L290 TraceCheckUtils]: 24: Hoare triple {701#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {686#false} is VALID [2022-04-15 14:14:30,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-15 14:14:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:14:30,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202335251] [2022-04-15 14:14:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202335251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:30,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:14:30,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:30,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [772490660] [2022-04-15 14:14:30,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [772490660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:30,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:30,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 14:14:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526492108] [2022-04-15 14:14:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:30,985 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 26 [2022-04-15 14:14:30,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:30,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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-15 14:14:31,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:31,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 14:14:31,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:31,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 14:14:31,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:14:31,006 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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-15 14:14:39,024 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:50,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:14:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:51,692 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2022-04-15 14:14:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 14:14:51,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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 26 [2022-04-15 14:14:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:14:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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-15 14:14:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-15 14:14:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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-15 14:14:51,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2022-04-15 14:14:51,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 87 transitions. [2022-04-15 14:14:52,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:52,029 INFO L225 Difference]: With dead ends: 74 [2022-04-15 14:14:52,029 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 14:14:52,029 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 14:14:52,030 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 38 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 70 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-04-15 14:14:52,031 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 51 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 219 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2022-04-15 14:14:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 14:14:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2022-04-15 14:14:52,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:14:52,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:14:52,065 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:14:52,065 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:14:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:52,070 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2022-04-15 14:14:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2022-04-15 14:14:52,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:52,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:52,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 72 states. [2022-04-15 14:14:52,073 INFO L87 Difference]: Start difference. First operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 72 states. [2022-04-15 14:14:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:14:52,077 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2022-04-15 14:14:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 106 transitions. [2022-04-15 14:14:52,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:14:52,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:14:52,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:14:52,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:14:52,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 33 states have internal predecessors, (37), 27 states have call successors, (27), 6 states have call predecessors, (27), 5 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:14:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-15 14:14:52,082 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 26 [2022-04-15 14:14:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:14:52,082 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-15 14:14:52,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (5), 3 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-15 14:14:52,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-15 14:14:52,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-15 14:14:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:14:52,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:14:52,375 INFO L499 BasicCegarLoop]: trace histogram [3, 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, 1] [2022-04-15 14:14:52,375 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 14:14:52,375 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:14:52,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:14:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-15 14:14:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:52,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073444188] [2022-04-15 14:14:52,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:14:52,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 2 times [2022-04-15 14:14:52,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:14:52,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163483475] [2022-04-15 14:14:52,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:14:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:14:52,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:14:52,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110254677] [2022-04-15 14:14:52,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:14:52,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:14:52,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:14:52,414 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:14:52,453 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:14:52,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:14:52,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:14:52,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:14:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:14:52,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:14:52,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {1133#true} call ULTIMATE.init(); {1133#true} is VALID [2022-04-15 14:14:52,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1133#true} is VALID [2022-04-15 14:14:52,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 14:14:52,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} #103#return; {1133#true} is VALID [2022-04-15 14:14:52,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} call #t~ret5 := main(); {1133#true} is VALID [2022-04-15 14:14:52,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1133#true} is VALID [2022-04-15 14:14:52,729 INFO L272 TraceCheckUtils]: 6: Hoare triple {1133#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {1133#true} is VALID [2022-04-15 14:14:52,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-15 14:14:52,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-15 14:14:52,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 14:14:52,745 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1133#true} {1133#true} #81#return; {1133#true} is VALID [2022-04-15 14:14:52,745 INFO L272 TraceCheckUtils]: 11: Hoare triple {1133#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1133#true} is VALID [2022-04-15 14:14:52,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-15 14:14:52,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-15 14:14:52,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 14:14:52,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1133#true} {1133#true} #83#return; {1133#true} is VALID [2022-04-15 14:14:52,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {1133#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:52,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:52,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:52,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:52,751 INFO L272 TraceCheckUtils]: 20: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1133#true} is VALID [2022-04-15 14:14:52,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-15 14:14:52,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-15 14:14:52,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 14:14:52,752 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1133#true} {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:52,753 INFO L272 TraceCheckUtils]: 25: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1133#true} is VALID [2022-04-15 14:14:52,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-15 14:14:52,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-15 14:14:52,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-15 14:14:52,754 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1133#true} {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-15 14:14:52,755 INFO L272 TraceCheckUtils]: 30: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:14:52,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:14:52,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {1233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1134#false} is VALID [2022-04-15 14:14:52,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {1134#false} assume !false; {1134#false} is VALID [2022-04-15 14:14:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 14:14:52,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:14:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:14:52,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163483475] [2022-04-15 14:14:52,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:14:52,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110254677] [2022-04-15 14:14:52,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110254677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:52,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:52,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:14:52,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:14:52,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073444188] [2022-04-15 14:14:52,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073444188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:14:52,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:14:52,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:14:52,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902540328] [2022-04-15 14:14:52,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:14:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 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:14:52,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:14:52,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:14:52,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:14:52,798 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:14:52,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:14:52,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:14:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:14:52,799 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:02,200 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2022-04-15 14:15:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:15:02,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 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:15:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:02,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:15:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2022-04-15 14:15:02,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2022-04-15 14:15:02,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:02,277 INFO L225 Difference]: With dead ends: 73 [2022-04-15 14:15:02,277 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 14:15:02,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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:15:02,279 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:02,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 14:15:02,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 14:15:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 14:15:02,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:02,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:15:02,303 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:15:02,303 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:15:02,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:02,306 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-04-15 14:15:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-04-15 14:15:02,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:02,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:02,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-15 14:15:02,308 INFO L87 Difference]: Start difference. First operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 50 states. [2022-04-15 14:15:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:02,311 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-04-15 14:15:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-04-15 14:15:02,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:02,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:02,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:02,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-15 14:15:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2022-04-15 14:15:02,314 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 69 transitions. Word has length 34 [2022-04-15 14:15:02,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:02,314 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 69 transitions. [2022-04-15 14:15:02,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:02,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 69 transitions. [2022-04-15 14:15:02,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 69 transitions. [2022-04-15 14:15:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 14:15:02,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:02,578 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:15:02,584 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:15:02,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:15:02,779 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-15 14:15:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:02,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [877828899] [2022-04-15 14:15:02,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 2 times [2022-04-15 14:15:02,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:02,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517231570] [2022-04-15 14:15:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:02,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:02,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:15:02,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410235021] [2022-04-15 14:15:02,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:15:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:15:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:15:02,816 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:15:02,817 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:15:02,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:15:02,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:15:02,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:15:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:15:02,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:15:03,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {1587#true} call ULTIMATE.init(); {1587#true} is VALID [2022-04-15 14:15:03,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {1587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1587#true} is VALID [2022-04-15 14:15:03,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1587#true} {1587#true} #103#return; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {1587#true} call #t~ret5 := main(); {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {1587#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {1587#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 5 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1587#true} {1587#true} #81#return; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {1587#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:15:03,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:15:03,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1587#true} {1587#true} #83#return; {1587#true} is VALID [2022-04-15 14:15:03,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {1587#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,051 INFO L272 TraceCheckUtils]: 22: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:15:03,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:15:03,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:15:03,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:15:03,052 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1587#true} {1640#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,052 INFO L272 TraceCheckUtils]: 27: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1587#true} is VALID [2022-04-15 14:15:03,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {1587#true} ~cond := #in~cond; {1587#true} is VALID [2022-04-15 14:15:03,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {1587#true} assume !(0 == ~cond); {1587#true} is VALID [2022-04-15 14:15:03,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {1587#true} assume true; {1587#true} is VALID [2022-04-15 14:15:03,053 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1587#true} {1640#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1640#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-15 14:15:03,054 INFO L272 TraceCheckUtils]: 32: Hoare triple {1640#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1689#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:15:03,054 INFO L290 TraceCheckUtils]: 33: Hoare triple {1689#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1693#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:15:03,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {1693#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1588#false} is VALID [2022-04-15 14:15:03,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {1588#false} assume !false; {1588#false} is VALID [2022-04-15 14:15:03,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 14:15:03,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:15:03,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:15:03,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517231570] [2022-04-15 14:15:03,055 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:15:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410235021] [2022-04-15 14:15:03,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410235021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:03,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:03,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:15:03,056 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:15:03,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [877828899] [2022-04-15 14:15:03,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [877828899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:15:03,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:15:03,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:15:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81743560] [2022-04-15 14:15:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:15:03,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 14:15:03,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:15:03,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:03,086 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-15 14:15:03,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:15:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:03,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:15:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:15:03,087 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:14,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:14,265 INFO L93 Difference]: Finished difference Result 69 states and 94 transitions. [2022-04-15 14:15:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:15:14,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 14:15:14,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:15:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 14:15:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 14:15:14,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-15 14:15:14,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:15:14,351 INFO L225 Difference]: With dead ends: 69 [2022-04-15 14:15:14,351 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 14:15:14,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 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:15:14,352 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 14:15:14,353 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 14:15:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 14:15:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-15 14:15:14,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:15:14,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:15:14,388 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:15:14,389 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:15:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:14,392 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-15 14:15:14,392 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-15 14:15:14,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:14,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:14,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 66 states. [2022-04-15 14:15:14,393 INFO L87 Difference]: Start difference. First operand has 66 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 66 states. [2022-04-15 14:15:14,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:15:14,397 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-15 14:15:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-15 14:15:14,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:15:14,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:15:14,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:15:14,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:15:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 27 states have call successors, (27), 7 states have call predecessors, (27), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-15 14:15:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 90 transitions. [2022-04-15 14:15:14,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 90 transitions. Word has length 36 [2022-04-15 14:15:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:15:14,401 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 90 transitions. [2022-04-15 14:15:14,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:15:14,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 90 transitions. [2022-04-15 14:15:14,790 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:15:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-15 14:15:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 14:15:14,791 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:15:14,791 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:15:14,795 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:15:14,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:15:14,992 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:15:14,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:15:14,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-15 14:15:14,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:15:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [574349069] [2022-04-15 14:15:14,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:15:14,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 2 times [2022-04-15 14:15:14,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:15:14,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056223685] [2022-04-15 14:15:14,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:15:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:15:15,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:15:15,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911947640] [2022-04-15 14:15:15,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:15:15,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:15:15,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:15:15,019 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:15:15,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process