/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:49:00,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:49:00,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:49:00,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:49:00,330 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:49:00,332 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:49:00,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:49:00,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:49:00,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:49:00,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:49:00,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:49:00,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:49:00,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:49:00,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:49:00,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:49:00,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:49:00,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:49:00,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:49:00,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:49:00,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:49:00,354 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:49:00,355 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:49:00,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:49:00,356 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:49:00,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:49:00,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:49:00,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:49:00,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:49:00,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:49:00,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:49:00,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:49:00,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:49:00,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:49:00,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:49:00,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:49:00,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:49:00,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:49:00,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:49:00,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:49:00,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:49:00,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:49:00,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:49:00,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:49:00,377 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:49:00,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:49:00,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:49:00,378 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:49:00,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:49:00,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:49:00,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:49:00,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:49:00,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:49:00,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:49:00,379 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:49:00,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:49:00,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:49:00,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:49:00,380 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:49:00,381 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:49:00,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:49:00,381 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:49:00,381 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-28 04:49:00,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:49:00,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:49:00,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:49:00,577 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:49:00,578 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:49:00,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-04-28 04:49:00,617 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d07206bf/12dc3abf522e4d9d9c7ffff62aff9e37/FLAGa81b192dc [2022-04-28 04:49:00,990 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:49:00,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound1.c [2022-04-28 04:49:00,996 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d07206bf/12dc3abf522e4d9d9c7ffff62aff9e37/FLAGa81b192dc [2022-04-28 04:49:01,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d07206bf/12dc3abf522e4d9d9c7ffff62aff9e37 [2022-04-28 04:49:01,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:49:01,010 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:49:01,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:49:01,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:49:01,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:49:01,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e076e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01, skipping insertion in model container [2022-04-28 04:49:01,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,020 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:49:01,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:49:01,187 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_unwindbound1.c[525,538] [2022-04-28 04:49:01,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:49:01,230 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:49:01,239 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_unwindbound1.c[525,538] [2022-04-28 04:49:01,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:49:01,269 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:49:01,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01 WrapperNode [2022-04-28 04:49:01,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:49:01,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:49:01,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:49:01,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:49:01,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:49:01,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:49:01,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:49:01,294 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:49:01,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (1/1) ... [2022-04-28 04:49:01,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:49:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:49:01,336 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-28 04:49:01,352 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-28 04:49:01,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:49:01,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:49:01,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:49:01,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:49:01,380 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:49:01,380 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:49:01,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:49:01,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:49:01,443 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:49:01,444 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:49:01,597 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:49:01,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:49:01,601 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:49:01,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:49:01 BoogieIcfgContainer [2022-04-28 04:49:01,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:49:01,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:49:01,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:49:01,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:49:01,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:49:01" (1/3) ... [2022-04-28 04:49:01,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce11f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:49:01, skipping insertion in model container [2022-04-28 04:49:01,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:49:01" (2/3) ... [2022-04-28 04:49:01,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce11f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:49:01, skipping insertion in model container [2022-04-28 04:49:01,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:49:01" (3/3) ... [2022-04-28 04:49:01,606 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound1.c [2022-04-28 04:49:01,636 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:49:01,637 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:49:01,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:49:01,678 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a6b7a44, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34f0ab [2022-04-28 04:49:01,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:49:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 04:49:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:49:01,690 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:01,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:01,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-28 04:49:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:01,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1864256831] [2022-04-28 04:49:01,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 2 times [2022-04-28 04:49:01,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:01,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679978895] [2022-04-28 04:49:01,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:01,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:49:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:01,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-28 04:49:01,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:49:01,897 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-28 04:49:01,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:49:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:01,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:49:01,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:49:01,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:49:01,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-28 04:49:01,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:49:01,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-28 04:49:01,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-28 04:49:01,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-28 04:49:01,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-28 04:49:01,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-28 04:49:01,916 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-28 04:49:01,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-28 04:49:01,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-28 04:49:01,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-28 04:49:01,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-28 04:49:01,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-28 04:49:01,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 04:49:01,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-28 04:49:01,919 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#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)); {43#false} is VALID [2022-04-28 04:49:01,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-28 04:49:01,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-28 04:49:01,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-28 04:49:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:49:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:01,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679978895] [2022-04-28 04:49:01,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679978895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:01,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:01,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:49:01,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:01,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1864256831] [2022-04-28 04:49:01,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1864256831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:01,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:01,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:49:01,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448356861] [2022-04-28 04:49:01,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:01,929 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 04:49:01,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:01,932 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:01,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:49:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:01,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:49:01,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:49:01,976 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:13,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:13,579 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-28 04:49:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:49:13,579 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-28 04:49:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:13,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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:13,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 04:49:13,599 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-28 04:49:13,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-28 04:49:13,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:13,759 INFO L225 Difference]: With dead ends: 70 [2022-04-28 04:49:13,759 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:49:13,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:49:13,765 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:49:13,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:49:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:49:13,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-28 04:49:13,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:13,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:13,787 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:13,787 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:13,790 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 04:49:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 04:49:13,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:13,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:13,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-28 04:49:13,791 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-28 04:49:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:13,794 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 04:49:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 04:49:13,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:13,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:13,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:13,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-28 04:49:13,798 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-28 04:49:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:13,799 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-28 04:49:13,799 INFO L496 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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:13,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 46 transitions. [2022-04-28 04:49:13,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-28 04:49:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 04:49:13,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:13,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:13,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:49:13,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-28 04:49:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1677080922] [2022-04-28 04:49:13,843 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 2 times [2022-04-28 04:49:13,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:13,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037120437] [2022-04-28 04:49:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:13,860 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:49:13,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [753890843] [2022-04-28 04:49:13,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:49:13,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:13,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:49:13,888 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-28 04:49:13,905 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-28 04:49:13,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:49:13,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:49:13,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 04:49:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:13,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:49:14,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2022-04-28 04:49:14,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#(<= ~counter~0 0)} {332#true} #102#return; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#(<= ~counter~0 0)} call #t~ret7 := main(); {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {340#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {340#(<= ~counter~0 0)} ~cond := #in~cond; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= ~counter~0 0)} assume !(0 == ~cond); {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {340#(<= ~counter~0 0)} assume true; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,099 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {340#(<= ~counter~0 0)} {340#(<= ~counter~0 0)} #82#return; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {340#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {340#(<= ~counter~0 0)} is VALID [2022-04-28 04:49:14,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {340#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {374#(<= |main_#t~post5| 0)} is VALID [2022-04-28 04:49:14,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {374#(<= |main_#t~post5| 0)} assume !(#t~post5 < 1);havoc #t~post5; {333#false} is VALID [2022-04-28 04:49:14,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {333#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {333#false} is VALID [2022-04-28 04:49:14,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {333#false} assume !(#t~post6 < 1);havoc #t~post6; {333#false} is VALID [2022-04-28 04:49:14,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {333#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)); {333#false} is VALID [2022-04-28 04:49:14,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2022-04-28 04:49:14,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2022-04-28 04:49:14,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {333#false} assume !false; {333#false} is VALID [2022-04-28 04:49:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:49:14,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:49:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:14,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037120437] [2022-04-28 04:49:14,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:49:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753890843] [2022-04-28 04:49:14,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753890843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:14,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:14,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:49:14,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1677080922] [2022-04-28 04:49:14,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1677080922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:14,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:14,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:49:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16606393] [2022-04-28 04:49:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 04:49:14,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:14,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:14,120 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-28 04:49:14,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:49:14,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:14,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:49:14,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:49:14,121 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:19,534 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-28 04:49:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:49:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 04:49:19,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:19,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 04:49:19,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-28 04:49:19,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-28 04:49:19,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:19,620 INFO L225 Difference]: With dead ends: 55 [2022-04-28 04:49:19,620 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 04:49:19,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:49:19,622 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:49:19,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:49:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 04:49:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 04:49:19,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:19,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:19,633 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:19,633 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:19,635 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-28 04:49:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-28 04:49:19,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:19,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:19,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-28 04:49:19,636 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-28 04:49:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:19,638 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-28 04:49:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-28 04:49:19,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:19,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:19,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:19,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:19,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 04:49:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-28 04:49:19,642 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-28 04:49:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:19,642 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-28 04:49:19,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:19,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 48 transitions. [2022-04-28 04:49:19,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-28 04:49:19,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:49:19,684 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:19,684 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:19,716 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-28 04:49:19,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:19,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:19,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-28 04:49:19,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:19,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1457826191] [2022-04-28 04:49:19,902 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:19,902 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 2 times [2022-04-28 04:49:19,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:19,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716543317] [2022-04-28 04:49:19,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:19,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:19,914 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:49:19,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189299066] [2022-04-28 04:49:19,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:49:19,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:49:19,916 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-28 04:49:19,917 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-28 04:49:19,963 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:49:19,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:49:19,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:49:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:19,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:49:20,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {649#true} call ULTIMATE.init(); {649#true} is VALID [2022-04-28 04:49:20,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {649#true} is VALID [2022-04-28 04:49:20,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-28 04:49:20,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {649#true} {649#true} #102#return; {649#true} is VALID [2022-04-28 04:49:20,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {649#true} call #t~ret7 := main(); {649#true} is VALID [2022-04-28 04:49:20,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {649#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {649#true} is VALID [2022-04-28 04:49:20,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {649#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {649#true} is VALID [2022-04-28 04:49:20,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#true} ~cond := #in~cond; {649#true} is VALID [2022-04-28 04:49:20,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#true} assume !(0 == ~cond); {649#true} is VALID [2022-04-28 04:49:20,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {649#true} assume true; {649#true} is VALID [2022-04-28 04:49:20,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {649#true} {649#true} #82#return; {649#true} is VALID [2022-04-28 04:49:20,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {649#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:49:20,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:49:20,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 1);havoc #t~post5; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:49:20,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:49:20,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:49:20,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {687#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(#t~post6 < 1);havoc #t~post6; {687#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-28 04:49:20,087 INFO L272 TraceCheckUtils]: 17: Hoare triple {687#(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 + 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)); {706#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:49:20,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {706#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {710#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:20,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {710#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {650#false} is VALID [2022-04-28 04:49:20,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {650#false} assume !false; {650#false} is VALID [2022-04-28 04:49:20,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:49:20,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:49:20,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716543317] [2022-04-28 04:49:20,088 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:49:20,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189299066] [2022-04-28 04:49:20,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189299066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:20,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:20,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:49:20,089 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:20,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1457826191] [2022-04-28 04:49:20,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1457826191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:20,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:20,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:49:20,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169922730] [2022-04-28 04:49:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 04:49:20,090 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:20,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:20,106 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-28 04:49:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:49:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:20,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:49:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:49:20,107 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:26,891 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-04-28 04:49:26,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:49:26,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-28 04:49:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-28 04:49:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-28 04:49:26,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-28 04:49:26,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:26,996 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:49:26,997 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:49:27,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-28 04:49:27,002 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 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-28 04:49:27,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 151 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:49:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:49:27,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 04:49:27,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:27,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 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-28 04:49:27,031 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 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-28 04:49:27,032 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 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-28 04:49:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:27,037 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-28 04:49:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-28 04:49:27,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:27,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:27,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 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 51 states. [2022-04-28 04:49:27,045 INFO L87 Difference]: Start difference. First operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 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 51 states. [2022-04-28 04:49:27,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:27,050 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-28 04:49:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-28 04:49:27,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:27,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:27,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:27,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 28 states have internal predecessors, (34), 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-28 04:49:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-04-28 04:49:27,053 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 21 [2022-04-28 04:49:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:27,053 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-04-28 04:49:27,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-28 04:49:27,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 71 transitions. [2022-04-28 04:49:27,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-04-28 04:49:27,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:49:27,150 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:27,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:27,165 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-28 04:49:27,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 04:49:27,355 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:27,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:27,356 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-28 04:49:27,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:27,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [212089571] [2022-04-28 04:49:27,356 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:27,357 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 2 times [2022-04-28 04:49:27,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:27,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762536314] [2022-04-28 04:49:27,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:27,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:27,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:49:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:27,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {1042#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {1035#(<= 0 ~counter~0)} assume true; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1035#(<= 0 ~counter~0)} {1030#true} #102#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 04:49:27,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:27,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#true} ~cond := #in~cond; {1030#true} is VALID [2022-04-28 04:49:27,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {1030#true} assume !(0 == ~cond); {1030#true} is VALID [2022-04-28 04:49:27,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {1030#true} assume true; {1030#true} is VALID [2022-04-28 04:49:27,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1030#true} {1035#(<= 0 ~counter~0)} #82#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1042#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:49:27,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {1035#(<= 0 ~counter~0)} assume true; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1035#(<= 0 ~counter~0)} {1030#true} #102#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {1035#(<= 0 ~counter~0)} call #t~ret7 := main(); {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {1035#(<= 0 ~counter~0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,464 INFO L272 TraceCheckUtils]: 6: Hoare triple {1035#(<= 0 ~counter~0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1030#true} is VALID [2022-04-28 04:49:27,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1030#true} ~cond := #in~cond; {1030#true} is VALID [2022-04-28 04:49:27,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1030#true} assume !(0 == ~cond); {1030#true} is VALID [2022-04-28 04:49:27,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#true} assume true; {1030#true} is VALID [2022-04-28 04:49:27,465 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1030#true} {1035#(<= 0 ~counter~0)} #82#return; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1035#(<= 0 ~counter~0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1035#(<= 0 ~counter~0)} is VALID [2022-04-28 04:49:27,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {1035#(<= 0 ~counter~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1040#(<= 1 ~counter~0)} is VALID [2022-04-28 04:49:27,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#(<= 1 ~counter~0)} assume !!(#t~post5 < 1);havoc #t~post5; {1040#(<= 1 ~counter~0)} is VALID [2022-04-28 04:49:27,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {1040#(<= 1 ~counter~0)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1040#(<= 1 ~counter~0)} is VALID [2022-04-28 04:49:27,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {1040#(<= 1 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1041#(<= 1 |main_#t~post6|)} is VALID [2022-04-28 04:49:27,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {1041#(<= 1 |main_#t~post6|)} assume !!(#t~post6 < 1);havoc #t~post6; {1031#false} is VALID [2022-04-28 04:49:27,467 INFO L272 TraceCheckUtils]: 17: Hoare triple {1031#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1031#false} is VALID [2022-04-28 04:49:27,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {1031#false} ~cond := #in~cond; {1031#false} is VALID [2022-04-28 04:49:27,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {1031#false} assume 0 == ~cond; {1031#false} is VALID [2022-04-28 04:49:27,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2022-04-28 04:49:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:49:27,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:27,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762536314] [2022-04-28 04:49:27,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762536314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:27,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:49:27,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:27,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [212089571] [2022-04-28 04:49:27,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [212089571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:27,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:27,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:49:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089892685] [2022-04-28 04:49:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:27,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 04:49:27,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:27,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:27,490 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-28 04:49:27,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:49:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:49:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:49:27,491 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:27,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:27,827 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2022-04-28 04:49:27,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:49:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-28 04:49:27,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 04:49:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2022-04-28 04:49:27,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2022-04-28 04:49:27,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:27,918 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:49:27,918 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:49:27,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:49:27,923 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:49:27,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 37 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:49:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:49:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 04:49:27,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:27,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:49:27,950 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:49:27,950 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:49:27,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:27,953 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 04:49:27,953 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 04:49:27,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:27,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:27,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 04:49:27,954 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-28 04:49:27,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:27,955 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 04:49:27,955 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 04:49:27,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:27,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:27,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:27,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:49:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-28 04:49:27,958 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2022-04-28 04:49:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:27,958 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-28 04:49:27,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:49:27,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-28 04:49:27,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-28 04:49:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 04:49:27,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:49:27,996 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:49:27,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:49:27,997 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:49:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:49:27,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1439696200, now seen corresponding path program 1 times [2022-04-28 04:49:27,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:27,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153795764] [2022-04-28 04:49:27,998 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:49:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1439696200, now seen corresponding path program 2 times [2022-04-28 04:49:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:49:27,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170437121] [2022-04-28 04:49:27,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:49:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:49:28,024 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:49:28,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1177863324] [2022-04-28 04:49:28,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:49:28,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:28,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:49:28,029 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-28 04:49:28,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:49:28,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:49:28,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:49:28,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 04:49:28,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:49:28,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:49:28,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {1294#true} call ULTIMATE.init(); {1294#true} is VALID [2022-04-28 04:49:28,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1294#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1294#true} is VALID [2022-04-28 04:49:28,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 04:49:28,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1294#true} {1294#true} #102#return; {1294#true} is VALID [2022-04-28 04:49:28,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {1294#true} call #t~ret7 := main(); {1294#true} is VALID [2022-04-28 04:49:28,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {1294#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1294#true} is VALID [2022-04-28 04:49:28,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {1294#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1294#true} is VALID [2022-04-28 04:49:28,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {1294#true} ~cond := #in~cond; {1294#true} is VALID [2022-04-28 04:49:28,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {1294#true} assume !(0 == ~cond); {1294#true} is VALID [2022-04-28 04:49:28,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 04:49:28,190 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1294#true} {1294#true} #82#return; {1294#true} is VALID [2022-04-28 04:49:28,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {1294#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 1);havoc #t~post5; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(#t~post6 < 1);havoc #t~post6; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,194 INFO L272 TraceCheckUtils]: 17: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} 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)); {1294#true} is VALID [2022-04-28 04:49:28,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {1294#true} ~cond := #in~cond; {1294#true} is VALID [2022-04-28 04:49:28,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {1294#true} assume !(0 == ~cond); {1294#true} is VALID [2022-04-28 04:49:28,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {1294#true} assume true; {1294#true} is VALID [2022-04-28 04:49:28,196 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1294#true} {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #96#return; {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-28 04:49:28,197 INFO L272 TraceCheckUtils]: 22: Hoare triple {1332#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:49:28,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {1366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:49:28,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {1370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1295#false} is VALID [2022-04-28 04:49:28,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {1295#false} assume !false; {1295#false} is VALID [2022-04-28 04:49:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:49:28,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:49:28,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:49:28,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170437121] [2022-04-28 04:49:28,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:49:28,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177863324] [2022-04-28 04:49:28,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177863324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:28,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:28,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:49:28,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:49:28,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153795764] [2022-04-28 04:49:28,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153795764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:49:28,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:49:28,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:49:28,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744935693] [2022-04-28 04:49:28,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:49:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 04:49:28,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:49:28,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:49:28,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:28,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:49:28,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:49:28,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:49:28,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:49:28,219 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:49:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:28,290 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-28 04:49:28,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:49:28,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-28 04:49:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:49:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:49:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 04:49:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:49:28,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 04:49:28,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 04:49:28,305 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-28 04:49:28,306 INFO L225 Difference]: With dead ends: 29 [2022-04-28 04:49:28,306 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:49:28,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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-28 04:49:28,307 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:49:28,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:49:28,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:49:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:49:28,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:49:28,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:49:28,308 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:49:28,308 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:49:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:28,308 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:49:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:49:28,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:28,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:28,308 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:49:28,308 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:49:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:49:28,309 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:49:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:49:28,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:28,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:49:28,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:49:28,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:49:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:49:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:49:28,309 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-28 04:49:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:49:28,309 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:49:28,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:49:28,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:49:28,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:49:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:49:28,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:49:28,312 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:49:28,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:49:28,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:49:28,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:49:28,874 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-28 04:49:28,874 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-28 04:49:28,874 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-28 04:49:28,874 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-28 04:49:28,874 INFO L902 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-28 04:49:28,874 INFO L902 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-28 04:49:28,874 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-28 04:49:28,874 INFO L895 garLoopResultBuilder]: At program point L31(lines 31 32) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,874 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 20 61) the Hoare annotation is: true [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L52(lines 52 55) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 20 61) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L44(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L40(line 40) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L24-1(line 24) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 20 61) the Hoare annotation is: true [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,875 INFO L895 garLoopResultBuilder]: At program point L38(lines 38 56) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0) (<= 1 |main_#t~post6|)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 56) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 20 61) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point L30-1(lines 30 35) the Hoare annotation is: (or (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 1 ~counter~0) (= main_~h~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 35) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~p~0 0) (= main_~n~0 main_~r~0) (<= 0 ~counter~0) (= main_~h~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L902 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: true [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point L39-1(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 04:49:28,876 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 04:49:28,876 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:49:28,877 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-28 04:49:28,877 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:49:28,877 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:49:28,877 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-28 04:49:28,877 INFO L895 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:49:28,877 INFO L895 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 04:49:28,877 INFO L895 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 04:49:28,877 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (not (<= 1 ~counter~0)) (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-28 04:49:28,877 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:49:28,879 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-28 04:49:28,880 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:49:28,883 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:49:28,885 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:49:28,907 INFO L163 areAnnotationChecker]: CFG has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:49:28,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:49:28 BoogieIcfgContainer [2022-04-28 04:49:28,914 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:49:28,915 INFO L158 Benchmark]: Toolchain (without parser) took 27904.95ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 139.2MB in the beginning and 128.4MB in the end (delta: 10.8MB). Peak memory consumption was 48.7MB. Max. memory is 8.0GB. [2022-04-28 04:49:28,915 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:49:28,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.43ms. Allocated memory is still 187.7MB. Free memory was 139.0MB in the beginning and 164.9MB in the end (delta: -25.8MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2022-04-28 04:49:28,916 INFO L158 Benchmark]: Boogie Preprocessor took 24.21ms. Allocated memory is still 187.7MB. Free memory was 164.4MB in the beginning and 163.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:49:28,916 INFO L158 Benchmark]: RCFGBuilder took 307.84ms. Allocated memory is still 187.7MB. Free memory was 163.0MB in the beginning and 149.1MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 04:49:28,916 INFO L158 Benchmark]: TraceAbstraction took 27311.28ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 148.7MB in the beginning and 128.4MB in the end (delta: 20.3MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. [2022-04-28 04:49:28,917 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory was 155.7MB in the beginning and 155.6MB in the end (delta: 74.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.43ms. Allocated memory is still 187.7MB. Free memory was 139.0MB in the beginning and 164.9MB in the end (delta: -25.8MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.21ms. Allocated memory is still 187.7MB. Free memory was 164.4MB in the beginning and 163.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 307.84ms. Allocated memory is still 187.7MB. Free memory was 163.0MB in the beginning and 149.1MB in the end (delta: 13.8MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 27311.28ms. Allocated memory was 187.7MB in the beginning and 225.4MB in the end (delta: 37.7MB). Free memory was 148.7MB in the beginning and 128.4MB in the end (delta: 20.3MB). Peak memory consumption was 57.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 24.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 434 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 146 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 186 mSDtfsCounter, 146 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 261 PreInvPairs, 295 NumberOfFragments, 375 HoareAnnotationTreeSize, 261 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 177 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (!(\old(counter) <= 0) || (((p == 0 && n == r) && 0 <= counter) && h == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: (!(1 <= counter) || !(1 <= \old(cond))) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-28 04:49:28,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...