/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/trex03-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:04:08,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:04:08,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:04:08,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:04:08,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:04:08,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:04:08,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:04:08,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:04:08,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:04:08,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:04:08,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:04:08,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:04:08,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:04:08,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:04:08,305 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:04:08,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:04:08,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:04:08,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:04:08,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:04:08,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:04:08,315 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:04:08,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:04:08,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:04:08,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:04:08,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:04:08,323 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:04:08,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:04:08,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:04:08,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:04:08,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:04:08,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:04:08,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:04:08,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:04:08,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:04:08,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:04:08,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:04:08,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:04:08,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:04:08,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:04:08,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:04:08,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:04:08,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:04:08,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 09:04:08,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:04:08,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:04:08,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:04:08,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:04:08,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:04:08,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:04:08,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:04:08,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:04:08,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:04:08,341 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:04:08,341 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:04:08,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:08,342 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:04:08,342 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:04:08,343 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:04:08,343 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:04:08,343 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 09:04:08,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:04:08,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:04:08,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:04:08,574 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:04:08,575 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:04:08,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/trex03-2.c [2022-04-28 09:04:08,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06895cae/fbfa27c799004419a5b19cff9f3defa4/FLAG7ab50fdee [2022-04-28 09:04:08,975 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:04:08,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03-2.c [2022-04-28 09:04:08,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06895cae/fbfa27c799004419a5b19cff9f3defa4/FLAG7ab50fdee [2022-04-28 09:04:09,412 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f06895cae/fbfa27c799004419a5b19cff9f3defa4 [2022-04-28 09:04:09,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:04:09,415 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:04:09,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:09,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:04:09,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:04:09,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f52ca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09, skipping insertion in model container [2022-04-28 09:04:09,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:04:09,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:04:09,558 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03-2.c[320,333] [2022-04-28 09:04:09,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:09,577 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:04:09,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/trex03-2.c[320,333] [2022-04-28 09:04:09,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:04:09,601 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:04:09,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09 WrapperNode [2022-04-28 09:04:09,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:04:09,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:04:09,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:04:09,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:04:09,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,635 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,640 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:04:09,640 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:04:09,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:04:09,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:04:09,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (1/1) ... [2022-04-28 09:04:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:04:09,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:04:09,680 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 09:04:09,715 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 09:04:09,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:04:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:04:09,732 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:04:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:04:09,733 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:04:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:04:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:04:09,733 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:04:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:04:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:04:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 09:04:09,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-28 09:04:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:04:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:04:09,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:04:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:04:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:04:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:04:09,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:04:09,797 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:04:09,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:04:09,932 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:04:09,937 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:04:09,937 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:04:09,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:09 BoogieIcfgContainer [2022-04-28 09:04:09,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:04:09,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:04:09,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:04:09,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:04:09,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:04:09" (1/3) ... [2022-04-28 09:04:09,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d44bb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:09, skipping insertion in model container [2022-04-28 09:04:09,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:04:09" (2/3) ... [2022-04-28 09:04:09,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d44bb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:04:09, skipping insertion in model container [2022-04-28 09:04:09,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:04:09" (3/3) ... [2022-04-28 09:04:09,946 INFO L111 eAbstractionObserver]: Analyzing ICFG trex03-2.c [2022-04-28 09:04:09,957 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:04:09,957 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:04:09,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:04:10,006 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@473008fd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d7f4bba [2022-04-28 09:04:10,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:04:10,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:04:10,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:04:10,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:10,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:10,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1016564801, now seen corresponding path program 1 times [2022-04-28 09:04:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:10,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1618407602] [2022-04-28 09:04:10,035 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1016564801, now seen corresponding path program 2 times [2022-04-28 09:04:10,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840242832] [2022-04-28 09:04:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:10,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:10,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 09:04:10,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:04:10,204 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #49#return; {25#true} is VALID [2022-04-28 09:04:10,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:10,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 09:04:10,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 09:04:10,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #49#return; {25#true} is VALID [2022-04-28 09:04:10,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-28 09:04:10,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x1~0 := #t~nondet4;havoc #t~nondet4;~x2~0 := #t~nondet5;havoc #t~nondet5;~x3~0 := #t~nondet6;havoc #t~nondet6;~d1~0 := 1;~d2~0 := 1;~d3~0 := 1;~c1~0 := #t~nondet7;havoc #t~nondet7;~c2~0 := #t~nondet8;havoc #t~nondet8; {25#true} is VALID [2022-04-28 09:04:10,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 09:04:10,210 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 || 0 == ~x2~0 % 4294967296) || 0 == ~x3~0 % 4294967296 then 1 else 0)); {26#false} is VALID [2022-04-28 09:04:10,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 09:04:10,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 09:04:10,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 09:04:10,211 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 09:04:10,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:10,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840242832] [2022-04-28 09:04:10,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840242832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:10,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:10,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:10,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:10,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1618407602] [2022-04-28 09:04:10,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1618407602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:10,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:10,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:04:10,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795537231] [2022-04-28 09:04:10,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:10,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:04:10,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:10,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:10,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:04:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:10,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:04:10,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:04:10,265 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:10,344 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-28 09:04:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:04:10,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:04:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:10,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 09:04:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-28 09:04:10,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-28 09:04:10,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:10,426 INFO L225 Difference]: With dead ends: 34 [2022-04-28 09:04:10,426 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:04:10,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:04:10,432 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:10,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:04:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:04:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:04:10,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:10,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,458 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,459 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:10,463 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:04:10,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:04:10,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:10,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:10,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:04:10,464 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:04:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:10,467 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:04:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:04:10,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:10,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:10,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:10,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-28 09:04:10,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2022-04-28 09:04:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:10,470 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-28 09:04:10,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-28 09:04:10,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 09:04:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:04:10,496 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:04:10,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:04:10,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:04:10,503 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:04:10,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:04:10,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1031341137, now seen corresponding path program 1 times [2022-04-28 09:04:10,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:10,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [59562302] [2022-04-28 09:04:10,507 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:04:10,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1031341137, now seen corresponding path program 2 times [2022-04-28 09:04:10,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:04:10,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278372488] [2022-04-28 09:04:10,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:04:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:04:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:04:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:04:10,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {161#true} is VALID [2022-04-28 09:04:10,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 09:04:10,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #49#return; {161#true} is VALID [2022-04-28 09:04:10,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:04:10,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {169#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {161#true} is VALID [2022-04-28 09:04:10,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-28 09:04:10,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #49#return; {161#true} is VALID [2022-04-28 09:04:10,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret11 := main(); {161#true} is VALID [2022-04-28 09:04:10,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} ~x1~0 := #t~nondet4;havoc #t~nondet4;~x2~0 := #t~nondet5;havoc #t~nondet5;~x3~0 := #t~nondet6;havoc #t~nondet6;~d1~0 := 1;~d2~0 := 1;~d3~0 := 1;~c1~0 := #t~nondet7;havoc #t~nondet7;~c2~0 := #t~nondet8;havoc #t~nondet8; {161#true} is VALID [2022-04-28 09:04:10,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#true} assume !((~x1~0 % 4294967296 > 0 && ~x2~0 % 4294967296 > 0) && ~x3~0 % 4294967296 > 0); {166#(or (= (+ main_~x3~0 (* (div main_~x3~0 4294967296) (- 4294967296))) 0) (= (+ (* (div main_~x2~0 4294967296) (- 4294967296)) main_~x2~0) 0) (= (+ (* (div main_~x1~0 4294967296) (- 4294967296)) main_~x1~0) 0))} is VALID [2022-04-28 09:04:10,623 INFO L272 TraceCheckUtils]: 7: Hoare triple {166#(or (= (+ main_~x3~0 (* (div main_~x3~0 4294967296) (- 4294967296))) 0) (= (+ (* (div main_~x2~0 4294967296) (- 4294967296)) main_~x2~0) 0) (= (+ (* (div main_~x1~0 4294967296) (- 4294967296)) main_~x1~0) 0))} call __VERIFIER_assert((if (0 == ~x1~0 % 4294967296 || 0 == ~x2~0 % 4294967296) || 0 == ~x3~0 % 4294967296 then 1 else 0)); {167#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:04:10,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {168#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:04:10,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {168#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-28 09:04:10,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-28 09:04:10,624 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 09:04:10,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:04:10,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278372488] [2022-04-28 09:04:10,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278372488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:10,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:10,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:04:10,625 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:04:10,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [59562302] [2022-04-28 09:04:10,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [59562302] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:04:10,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:04:10,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:04:10,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875681423] [2022-04-28 09:04:10,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:04:10,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:04:10,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:04:10,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:10,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:04:10,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:04:10,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:04:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:04:10,637 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:10,743 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 09:04:10,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:04:10,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:04:10,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:04:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 09:04:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2022-04-28 09:04:10,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 17 transitions. [2022-04-28 09:04:10,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:04:10,764 INFO L225 Difference]: With dead ends: 15 [2022-04-28 09:04:10,764 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 09:04:10,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 09:04:10,765 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:04:10,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 31 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:04:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 09:04:10,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 09:04:10,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:04:10,766 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 09:04:10,766 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 09:04:10,766 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 09:04:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:10,767 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:04:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:10,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:10,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:10,767 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 09:04:10,767 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 09:04:10,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:04:10,767 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 09:04:10,767 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:10,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:10,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:04:10,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:04:10,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:04:10,768 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 09:04:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 09:04:10,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-28 09:04:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:04:10,768 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 09:04:10,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:04:10,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 09:04:10,768 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 09:04:10,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 09:04:10,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:04:10,772 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:04:10,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:04:10,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 09:04:10,835 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 09:04:10,836 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 09:04:10,836 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 14 31) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point L23(lines 23 24) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point L23-2(lines 22 24) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 14 31) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 14 31) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point L22(lines 22 24) the Hoare annotation is: true [2022-04-28 09:04:10,836 INFO L902 garLoopResultBuilder]: At program point L20-2(lines 20 27) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 27) the Hoare annotation is: (or (= (+ main_~x3~0 (* (div main_~x3~0 4294967296) (- 4294967296))) 0) (= (+ (* (div main_~x2~0 4294967296) (- 4294967296)) main_~x2~0) 0) (= (+ (* (div main_~x1~0 4294967296) (- 4294967296)) main_~x1~0) 0)) [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2022-04-28 09:04:10,837 INFO L895 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:04:10,837 INFO L895 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-28 09:04:10,837 INFO L902 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2022-04-28 09:04:10,838 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-28 09:04:10,840 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2] [2022-04-28 09:04:10,841 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:04:10,843 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:04:10,848 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:04:10,849 INFO L163 areAnnotationChecker]: CFG has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 09:04:10,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:04:10 BoogieIcfgContainer [2022-04-28 09:04:10,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:04:10,859 INFO L158 Benchmark]: Toolchain (without parser) took 1440.95ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 156.5MB in the beginning and 149.7MB in the end (delta: 6.8MB). Peak memory consumption was 48.0MB. Max. memory is 8.0GB. [2022-04-28 09:04:10,860 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 207.6MB. Free memory was 172.7MB in the beginning and 172.6MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:04:10,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.55ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 156.4MB in the beginning and 225.8MB in the end (delta: -69.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:04:10,861 INFO L158 Benchmark]: Boogie Preprocessor took 37.23ms. Allocated memory is still 249.6MB. Free memory was 225.8MB in the beginning and 223.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:04:10,861 INFO L158 Benchmark]: RCFGBuilder took 298.68ms. Allocated memory is still 249.6MB. Free memory was 223.9MB in the beginning and 212.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:04:10,861 INFO L158 Benchmark]: TraceAbstraction took 914.62ms. Allocated memory is still 249.6MB. Free memory was 211.6MB in the beginning and 149.7MB in the end (delta: 61.9MB). Peak memory consumption was 61.9MB. Max. memory is 8.0GB. [2022-04-28 09:04:10,862 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.16ms. Allocated memory is still 207.6MB. Free memory was 172.7MB in the beginning and 172.6MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.55ms. Allocated memory was 207.6MB in the beginning and 249.6MB in the end (delta: 41.9MB). Free memory was 156.4MB in the beginning and 225.8MB in the end (delta: -69.4MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.23ms. Allocated memory is still 249.6MB. Free memory was 225.8MB in the beginning and 223.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 298.68ms. Allocated memory is still 249.6MB. Free memory was 223.9MB in the beginning and 212.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 914.62ms. Allocated memory is still 249.6MB. Free memory was 211.6MB in the beginning and 149.7MB in the end (delta: 61.9MB). Peak memory consumption was 61.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: 7]: 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 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 37 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 28 PreInvPairs, 36 NumberOfFragments, 66 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 20]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 09:04:10,895 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...