/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/loop-invariants/even.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:05:38,549 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:05:38,550 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:05:38,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:05:38,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:05:38,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:05:38,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:05:38,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:05:38,578 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:05:38,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:05:38,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:05:38,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:05:38,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:05:38,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:05:38,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:05:38,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:05:38,587 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:05:38,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:05:38,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:05:38,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:05:38,590 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:05:38,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:05:38,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:05:38,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:05:38,592 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:05:38,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:05:38,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:05:38,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:05:38,594 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:05:38,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:05:38,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:05:38,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:05:38,595 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:05:38,596 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:05:38,596 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:05:38,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:05:38,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:05:38,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:05:38,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:05:38,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:05:38,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:05:38,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:05:38,599 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:05:38,604 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:05:38,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:05:38,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:05:38,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:05:38,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:05:38,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:05:38,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:05:38,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:05:38,606 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:05:38,606 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:05:38,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:05:38,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:05:38,607 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:05:38,607 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:05:38,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:05:38,607 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:05:38,607 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:05:38,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:05:38,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:05:38,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:05:38,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:05:38,793 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:05:38,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/even.c [2022-04-28 04:05:38,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba073a88/63ae38429aa044a5be9845a639379121/FLAG26b26ad49 [2022-04-28 04:05:39,181 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:05:39,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/even.c [2022-04-28 04:05:39,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba073a88/63ae38429aa044a5be9845a639379121/FLAG26b26ad49 [2022-04-28 04:05:39,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ba073a88/63ae38429aa044a5be9845a639379121 [2022-04-28 04:05:39,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:05:39,635 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:05:39,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:05:39,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:05:39,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:05:39,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6119dd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39, skipping insertion in model container [2022-04-28 04:05:39,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,643 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:05:39,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:05:39,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/even.c[351,364] [2022-04-28 04:05:39,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:05:39,788 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:05:39,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/even.c[351,364] [2022-04-28 04:05:39,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:05:39,805 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:05:39,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39 WrapperNode [2022-04-28 04:05:39,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:05:39,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:05:39,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:05:39,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:05:39,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,813 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:05:39,824 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:05:39,824 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:05:39,824 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:05:39,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (1/1) ... [2022-04-28 04:05:39,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:05:39,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:05:39,859 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:05:39,864 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:05:39,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:05:39,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:05:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:05:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:05:39,885 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:05:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:05:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:05:39,885 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:05:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:05:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:05:39,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:05:39,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:05:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:05:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:05:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:05:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:05:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:05:39,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:05:39,931 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:05:39,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:05:39,992 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:05:39,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:05:39,996 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:05:39,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:05:39 BoogieIcfgContainer [2022-04-28 04:05:39,998 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:05:39,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:05:39,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:05:40,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:05:40,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:05:39" (1/3) ... [2022-04-28 04:05:40,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755cbb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:05:40, skipping insertion in model container [2022-04-28 04:05:40,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:05:39" (2/3) ... [2022-04-28 04:05:40,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755cbb9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:05:40, skipping insertion in model container [2022-04-28 04:05:40,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:05:39" (3/3) ... [2022-04-28 04:05:40,003 INFO L111 eAbstractionObserver]: Analyzing ICFG even.c [2022-04-28 04:05:40,012 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:05:40,012 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:05:40,040 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:05:40,044 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@32e0eeec, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19efe17f [2022-04-28 04:05:40,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:05:40,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 04:05:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:05:40,061 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:40,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:40,062 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:40,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1035305623, now seen corresponding path program 1 times [2022-04-28 04:05:40,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:40,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285402936] [2022-04-28 04:05:40,113 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:05:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1035305623, now seen corresponding path program 2 times [2022-04-28 04:05:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:40,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541337768] [2022-04-28 04:05:40,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:40,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:40,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:40,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(7, 2);call write~init~int(101, 2, 0, 1);call write~init~int(118, 2, 1, 1);call write~init~int(101, 2, 2, 1);call write~init~int(110, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 04:05:40,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:05:40,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2022-04-28 04:05:40,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:40,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(7, 2);call write~init~int(101, 2, 0, 1);call write~init~int(118, 2, 1, 1);call write~init~int(101, 2, 2, 1);call write~init~int(110, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 04:05:40,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:05:40,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2022-04-28 04:05:40,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-28 04:05:40,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 0; {23#true} is VALID [2022-04-28 04:05:40,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 04:05:40,323 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {24#false} is VALID [2022-04-28 04:05:40,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-28 04:05:40,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-28 04:05:40,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 04:05:40,324 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:05:40,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:40,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541337768] [2022-04-28 04:05:40,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541337768] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:40,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:40,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:05:40,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:40,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285402936] [2022-04-28 04:05:40,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285402936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:40,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:40,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:05:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671615778] [2022-04-28 04:05:40,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:40,334 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 04:05:40,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:40,337 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 04:05:40,361 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 04:05:40,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:05:40,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:05:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:05:40,389 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 04:05:40,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:40,478 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 04:05:40,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:05:40,480 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 04:05:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:40,481 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 04:05:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 04:05:40,490 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 04:05:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-28 04:05:40,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-28 04:05:40,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:40,541 INFO L225 Difference]: With dead ends: 32 [2022-04-28 04:05:40,541 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 04:05:40,543 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 04:05:40,547 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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 04:05:40,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:05:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 04:05:40,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 04:05:40,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:40,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 04:05:40,574 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 04:05:40,575 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 04:05:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:40,581 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 04:05:40,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 04:05:40,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:40,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:40,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 04:05:40,582 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 13 states. [2022-04-28 04:05:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:40,584 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 04:05:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 04:05:40,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:40,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:40,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:40,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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 04:05:40,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 04:05:40,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 04:05:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:40,589 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 04:05:40,589 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 04:05:40,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 04:05:40,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:40,605 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 04:05:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:05:40,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:40,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:40,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:05:40,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:40,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:40,614 INFO L85 PathProgramCache]: Analyzing trace with hash 2042096758, now seen corresponding path program 1 times [2022-04-28 04:05:40,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:40,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1186881462] [2022-04-28 04:05:40,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:05:40,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2042096758, now seen corresponding path program 2 times [2022-04-28 04:05:40,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:05:40,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463581270] [2022-04-28 04:05:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:05:40,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:05:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:40,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:05:40,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:05:40,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {155#(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(7, 2);call write~init~int(101, 2, 0, 1);call write~init~int(118, 2, 1, 1);call write~init~int(101, 2, 2, 1);call write~init~int(110, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 04:05:40,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 04:05:40,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147#true} {147#true} #38#return; {147#true} is VALID [2022-04-28 04:05:40,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {147#true} call ULTIMATE.init(); {155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:05:40,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {155#(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(7, 2);call write~init~int(101, 2, 0, 1);call write~init~int(118, 2, 1, 1);call write~init~int(101, 2, 2, 1);call write~init~int(110, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-04-28 04:05:40,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {147#true} assume true; {147#true} is VALID [2022-04-28 04:05:40,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147#true} {147#true} #38#return; {147#true} is VALID [2022-04-28 04:05:40,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {147#true} call #t~ret5 := main(); {147#true} is VALID [2022-04-28 04:05:40,716 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} ~x~0 := 0; {152#(= main_~x~0 0)} is VALID [2022-04-28 04:05:40,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {152#(= main_~x~0 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {152#(= main_~x~0 0)} is VALID [2022-04-28 04:05:40,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {152#(= main_~x~0 0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {152#(= main_~x~0 0)} is VALID [2022-04-28 04:05:40,718 INFO L272 TraceCheckUtils]: 8: Hoare triple {152#(= main_~x~0 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {153#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:05:40,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {153#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {154#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:05:40,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {154#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {148#false} is VALID [2022-04-28 04:05:40,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-04-28 04:05:40,719 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:05:40,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:05:40,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463581270] [2022-04-28 04:05:40,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463581270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:40,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:40,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:05:40,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:05:40,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1186881462] [2022-04-28 04:05:40,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1186881462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:05:40,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:05:40,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:05:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940102547] [2022-04-28 04:05:40,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:05:40,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 04:05:40,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:05:40,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 04:05:40,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:40,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:05:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:40,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:05:40,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:05:40,733 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 04:05:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:40,835 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 04:05:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:05:40,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 12 [2022-04-28 04:05:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:05:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 04:05:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 04:05:40,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 04:05:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 04:05:40,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 04:05:40,859 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:05:40,861 INFO L225 Difference]: With dead ends: 20 [2022-04-28 04:05:40,861 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 04:05:40,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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 04:05:40,864 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:05:40,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:05:40,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 04:05:40,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 04:05:40,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:05:40,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 04:05:40,870 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 04:05:40,870 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 04:05:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:40,871 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:05:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:05:40,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:40,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:40,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 04:05:40,873 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 04:05:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:05:40,874 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 04:05:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:05:40,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:05:40,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:05:40,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:05:40,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:05:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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 04:05:40,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 04:05:40,876 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-28 04:05:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:05:40,876 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 04:05:40,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 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 04:05:40,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 04:05:40,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:05:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 04:05:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:05:40,889 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:05:40,889 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:05:40,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:05:40,891 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:05:40,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:05:40,892 INFO L85 PathProgramCache]: Analyzing trace with hash 615626395, now seen corresponding path program 1 times [2022-04-28 04:05:40,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:05:40,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786295556] [2022-04-28 04:05:41,145 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:05:41,146 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:401) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:249) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.makeReflexive(PredicateHelper.java:222) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:253) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 04:05:41,149 INFO L158 Benchmark]: Toolchain (without parser) took 1514.14ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 135.6MB in the beginning and 172.4MB in the end (delta: -36.8MB). Peak memory consumption was 3.7MB. Max. memory is 8.0GB. [2022-04-28 04:05:41,149 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 152.0MB in the beginning and 151.9MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:05:41,149 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.16ms. Allocated memory is still 185.6MB. Free memory was 135.3MB in the beginning and 162.4MB in the end (delta: -27.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:05:41,150 INFO L158 Benchmark]: Boogie Preprocessor took 17.02ms. Allocated memory is still 185.6MB. Free memory was 162.4MB in the beginning and 161.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:05:41,150 INFO L158 Benchmark]: RCFGBuilder took 173.95ms. Allocated memory is still 185.6MB. Free memory was 161.1MB in the beginning and 151.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:05:41,150 INFO L158 Benchmark]: TraceAbstraction took 1149.67ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 150.6MB in the beginning and 172.4MB in the end (delta: -21.7MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. [2022-04-28 04:05:41,151 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 185.6MB. Free memory was 152.0MB in the beginning and 151.9MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.16ms. Allocated memory is still 185.6MB. Free memory was 135.3MB in the beginning and 162.4MB in the end (delta: -27.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.02ms. Allocated memory is still 185.6MB. Free memory was 162.4MB in the beginning and 161.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 173.95ms. Allocated memory is still 185.6MB. Free memory was 161.1MB in the beginning and 151.3MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1149.67ms. Allocated memory was 185.6MB in the beginning and 226.5MB in the end (delta: 40.9MB). Free memory was 150.6MB in the beginning and 172.4MB in the end (delta: -21.7MB). Peak memory consumption was 20.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.logic.Theory.term(Theory.java:1603) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 04:05:41,198 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...