/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/loops-crafted-1/in-de42.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 04:08:38,156 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 04:08:38,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 04:08:38,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 04:08:38,203 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 04:08:38,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 04:08:38,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 04:08:38,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 04:08:38,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 04:08:38,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 04:08:38,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 04:08:38,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 04:08:38,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 04:08:38,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 04:08:38,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 04:08:38,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 04:08:38,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 04:08:38,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 04:08:38,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 04:08:38,230 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 04:08:38,231 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 04:08:38,232 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 04:08:38,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 04:08:38,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 04:08:38,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 04:08:38,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 04:08:38,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 04:08:38,241 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 04:08:38,242 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 04:08:38,242 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 04:08:38,243 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 04:08:38,243 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 04:08:38,245 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 04:08:38,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 04:08:38,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 04:08:38,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 04:08:38,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 04:08:38,247 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 04:08:38,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 04:08:38,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 04:08:38,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 04:08:38,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 04:08:38,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-08 04:08:38,255 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 04:08:38,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 04:08:38,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 04:08:38,256 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 04:08:38,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 04:08:38,257 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 04:08:38,258 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 04:08:38,258 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 04:08:38,258 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 04:08:38,258 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 04:08:38,258 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 04:08:38,258 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 04:08:38,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 04:08:38,258 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 04:08:38,259 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 04:08:38,259 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 04:08:38,259 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 04:08:38,259 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 04:08:38,259 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 04:08:38,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 04:08:38,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 04:08:38,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 04:08:38,503 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 04:08:38,503 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 04:08:38,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c
[2022-04-08 04:08:38,560 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb40c5b/89e7aadf55244b1d9173e7b4171b9724/FLAGc72afc7d1
[2022-04-08 04:08:38,945 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 04:08:38,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c
[2022-04-08 04:08:38,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb40c5b/89e7aadf55244b1d9173e7b4171b9724/FLAGc72afc7d1
[2022-04-08 04:08:38,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3bb40c5b/89e7aadf55244b1d9173e7b4171b9724
[2022-04-08 04:08:38,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 04:08:38,968 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 04:08:38,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 04:08:38,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 04:08:38,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 04:08:38,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:38" (1/1) ...
[2022-04-08 04:08:38,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa6511d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:38, skipping insertion in model container
[2022-04-08 04:08:38,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:08:38" (1/1) ...
[2022-04-08 04:08:38,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 04:08:39,003 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 04:08:39,175 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-crafted-1/in-de42.c[368,381]
[2022-04-08 04:08:39,210 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 04:08:39,217 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 04:08:39,227 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-crafted-1/in-de42.c[368,381]
[2022-04-08 04:08:39,243 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 04:08:39,254 INFO L208 MainTranslator]: Completed translation
[2022-04-08 04:08:39,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39 WrapperNode
[2022-04-08 04:08:39,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 04:08:39,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 04:08:39,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 04:08:39,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 04:08:39,265 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 04:08:39,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 04:08:39,302 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 04:08:39,302 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 04:08:39,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (1/1) ...
[2022-04-08 04:08:39,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 04:08:39,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 04:08:39,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 04:08:39,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 04:08:39,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 04:08:39,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 04:08:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 04:08:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 04:08:39,375 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 04:08:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 04:08:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 04:08:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 04:08:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 04:08:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-08 04:08:39,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 04:08:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 04:08:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 04:08:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 04:08:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 04:08:39,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 04:08:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 04:08:39,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 04:08:39,434 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 04:08:39,436 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 04:08:39,645 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 04:08:39,655 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 04:08:39,655 INFO L299 CfgBuilder]: Removed 4 assume(true) statements.
[2022-04-08 04:08:39,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:39 BoogieIcfgContainer
[2022-04-08 04:08:39,657 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 04:08:39,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 04:08:39,658 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 04:08:39,681 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 04:08:39,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:08:38" (1/3) ...
[2022-04-08 04:08:39,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ace11d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:39, skipping insertion in model container
[2022-04-08 04:08:39,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:08:39" (2/3) ...
[2022-04-08 04:08:39,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ace11d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:08:39, skipping insertion in model container
[2022-04-08 04:08:39,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:08:39" (3/3) ...
[2022-04-08 04:08:39,683 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.c
[2022-04-08 04:08:39,687 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 04:08:39,687 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 04:08:39,721 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 04:08:39,729 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 04:08:39,729 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 04:08:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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-08 04:08:39,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-04-08 04:08:39,751 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 04:08:39,752 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 04:08:39,752 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 04:08:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 04:08:39,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times
[2022-04-08 04:08:39,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:39,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2037004692]
[2022-04-08 04:08:39,775 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 04:08:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times
[2022-04-08 04:08:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 04:08:39,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249057156]
[2022-04-08 04:08:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 04:08:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 04:08:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 04:08:39,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 04:08:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 04:08:39,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID
[2022-04-08 04:08:39,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-08 04:08:39,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID
[2022-04-08 04:08:39,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 04:08:39,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(10, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID
[2022-04-08 04:08:39,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID
[2022-04-08 04:08:39,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID
[2022-04-08 04:08:39,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID
[2022-04-08 04:08:39,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID
[2022-04-08 04:08:39,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID
[2022-04-08 04:08:39,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID
[2022-04-08 04:08:40,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID
[2022-04-08 04:08:40,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID
[2022-04-08 04:08:40,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID
[2022-04-08 04:08:40,001 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID
[2022-04-08 04:08:40,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID
[2022-04-08 04:08:40,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID
[2022-04-08 04:08:40,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID
[2022-04-08 04:08:40,003 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-08 04:08:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 04:08:40,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249057156]
[2022-04-08 04:08:40,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249057156] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 04:08:40,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 04:08:40,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 04:08:40,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 04:08:40,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2037004692]
[2022-04-08 04:08:40,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2037004692] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 04:08:40,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 04:08:40,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 04:08:40,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545043546]
[2022-04-08 04:08:40,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 04:08:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15
[2022-04-08 04:08:40,017 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 04:08:40,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-08 04:08:40,049 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-08 04:08:40,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 04:08:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:40,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 04:08:40,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 04:08:40,073 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-08 04:08:40,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:40,170 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions.
[2022-04-08 04:08:40,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 04:08:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15
[2022-04-08 04:08:40,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 04:08:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-08 04:08:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions.
[2022-04-08 04:08:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-08 04:08:40,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions.
[2022-04-08 04:08:40,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions.
[2022-04-08 04:08:40,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:40,283 INFO L225 Difference]: With dead ends: 39
[2022-04-08 04:08:40,283 INFO L226 Difference]: Without dead ends: 16
[2022-04-08 04:08:40,286 INFO L912 BasicCegarLoop]: 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-08 04:08:40,288 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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-08 04:08:40,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 04:08:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2022-04-08 04:08:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2022-04-08 04:08:40,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 04:08:40,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-08 04:08:40,313 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-08 04:08:40,314 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-08 04:08:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:40,316 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions.
[2022-04-08 04:08:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions.
[2022-04-08 04:08:40,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 04:08:40,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 04:08:40,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 16 states.
[2022-04-08 04:08:40,317 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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 16 states.
[2022-04-08 04:08:40,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:40,319 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions.
[2022-04-08 04:08:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions.
[2022-04-08 04:08:40,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 04:08:40,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 04:08:40,320 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 04:08:40,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 04:08:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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-08 04:08:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions.
[2022-04-08 04:08:40,324 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15
[2022-04-08 04:08:40,324 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 04:08:40,325 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions.
[2022-04-08 04:08:40,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-08 04:08:40,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions.
[2022-04-08 04:08:40,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions.
[2022-04-08 04:08:40,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2022-04-08 04:08:40,355 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 04:08:40,355 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 04:08:40,356 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 04:08:40,356 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 04:08:40,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 04:08:40,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times
[2022-04-08 04:08:40,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:40,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328121950]
[2022-04-08 04:08:40,357 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 04:08:40,357 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times
[2022-04-08 04:08:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 04:08:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589621168]
[2022-04-08 04:08:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 04:08:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 04:08:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 04:08:40,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 04:08:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 04:08:40,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#(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(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID
[2022-04-08 04:08:40,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID
[2022-04-08 04:08:40,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID
[2022-04-08 04:08:40,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 04:08:40,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(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(10, 2);call #Ultimate.allocInit(12, 3); {176#true} is VALID
[2022-04-08 04:08:40,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID
[2022-04-08 04:08:40,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID
[2022-04-08 04:08:40,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID
[2022-04-08 04:08:40,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID
[2022-04-08 04:08:40,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID
[2022-04-08 04:08:40,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} is VALID
[2022-04-08 04:08:40,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {183#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 04:08:40,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 04:08:40,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {184#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} is VALID
[2022-04-08 04:08:40,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {185#(and (< (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0 1)) (<= (+ (* (div (* main_~n~0 2) 4294967296) 4294967296) main_~z~0) (+ (* main_~n~0 2) (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {186#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-08 04:08:40,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {187#(not (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-08 04:08:40,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID
[2022-04-08 04:08:40,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID
[2022-04-08 04:08:40,720 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-08 04:08:40,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 04:08:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589621168]
[2022-04-08 04:08:40,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589621168] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 04:08:40,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 04:08:40,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 04:08:40,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 04:08:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328121950]
[2022-04-08 04:08:40,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328121950] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 04:08:40,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 04:08:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2022-04-08 04:08:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842989151]
[2022-04-08 04:08:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 04:08:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15
[2022-04-08 04:08:40,726 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 04:08:40,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-08 04:08:40,747 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-08 04:08:40,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2022-04-08 04:08:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2022-04-08 04:08:40,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2022-04-08 04:08:40,749 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-08 04:08:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:41,245 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions.
[2022-04-08 04:08:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-08 04:08:41,245 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15
[2022-04-08 04:08:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 04:08:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-08 04:08:41,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions.
[2022-04-08 04:08:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-08 04:08:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions.
[2022-04-08 04:08:41,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions.
[2022-04-08 04:08:41,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:41,298 INFO L225 Difference]: With dead ends: 33
[2022-04-08 04:08:41,298 INFO L226 Difference]: Without dead ends: 23
[2022-04-08 04:08:41,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210
[2022-04-08 04:08:41,300 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 04:08:41,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 04:08:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2022-04-08 04:08:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22.
[2022-04-08 04:08:41,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 04:08:41,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:08:41,313 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:08:41,314 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:08:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:41,315 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions.
[2022-04-08 04:08:41,315 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions.
[2022-04-08 04:08:41,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 04:08:41,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 04:08:41,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 23 states.
[2022-04-08 04:08:41,316 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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 23 states.
[2022-04-08 04:08:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:41,317 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions.
[2022-04-08 04:08:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions.
[2022-04-08 04:08:41,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 04:08:41,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 04:08:41,318 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 04:08:41,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 04:08:41,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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-08 04:08:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions.
[2022-04-08 04:08:41,319 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 15
[2022-04-08 04:08:41,320 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 04:08:41,320 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions.
[2022-04-08 04:08:41,320 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-08 04:08:41,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions.
[2022-04-08 04:08:41,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions.
[2022-04-08 04:08:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-04-08 04:08:41,353 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 04:08:41,353 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 04:08:41,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 04:08:41,353 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 04:08:41,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 04:08:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 1 times
[2022-04-08 04:08:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:41,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566348816]
[2022-04-08 04:08:41,355 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 04:08:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 971437455, now seen corresponding path program 2 times
[2022-04-08 04:08:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 04:08:41,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603723456]
[2022-04-08 04:08:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 04:08:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 04:08:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 04:08:41,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 04:08:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 04:08:41,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {363#(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(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID
[2022-04-08 04:08:41,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID
[2022-04-08 04:08:41,409 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID
[2022-04-08 04:08:41,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 04:08:41,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#(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(10, 2);call #Ultimate.allocInit(12, 3); {357#true} is VALID
[2022-04-08 04:08:41,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID
[2022-04-08 04:08:41,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID
[2022-04-08 04:08:41,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID
[2022-04-08 04:08:41,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(= main_~y~0 0)} is VALID
[2022-04-08 04:08:41,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID
[2022-04-08 04:08:41,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(= main_~y~0 0)} ~z~0 := ~y~0; {362#(= main_~y~0 0)} is VALID
[2022-04-08 04:08:41,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {362#(= main_~y~0 0)} is VALID
[2022-04-08 04:08:41,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {358#false} is VALID
[2022-04-08 04:08:41,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#false} assume !(~y~0 % 4294967296 > 0); {358#false} is VALID
[2022-04-08 04:08:41,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {358#false} assume !(~x~0 % 4294967296 > 0); {358#false} is VALID
[2022-04-08 04:08:41,413 INFO L272 TraceCheckUtils]: 12: Hoare triple {358#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == 2 * ~n~0 % 4294967296 then 1 else 0)); {358#false} is VALID
[2022-04-08 04:08:41,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID
[2022-04-08 04:08:41,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID
[2022-04-08 04:08:41,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID
[2022-04-08 04:08:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 04:08:41,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 04:08:41,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603723456]
[2022-04-08 04:08:41,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603723456] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 04:08:41,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 04:08:41,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 04:08:41,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 04:08:41,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566348816]
[2022-04-08 04:08:41,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566348816] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 04:08:41,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 04:08:41,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 04:08:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613765606]
[2022-04-08 04:08:41,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 04:08:41,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16
[2022-04-08 04:08:41,416 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 04:08:41,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:08:41,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:41,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 04:08:41,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 04:08:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 04:08:41,430 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:08:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:41,517 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions.
[2022-04-08 04:08:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2022-04-08 04:08:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 16
[2022-04-08 04:08:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 04:08:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:08:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions.
[2022-04-08 04:08:41,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:08:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions.
[2022-04-08 04:08:41,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions.
[2022-04-08 04:08:41,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:41,558 INFO L225 Difference]: With dead ends: 33
[2022-04-08 04:08:41,558 INFO L226 Difference]: Without dead ends: 23
[2022-04-08 04:08:41,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-04-08 04:08:41,559 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 04:08:41,561 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 04:08:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2022-04-08 04:08:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21.
[2022-04-08 04:08:41,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 04:08:41,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-08 04:08:41,567 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-08 04:08:41,567 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-08 04:08:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:41,569 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions.
[2022-04-08 04:08:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions.
[2022-04-08 04:08:41,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 04:08:41,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 04:08:41,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 23 states.
[2022-04-08 04:08:41,570 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 23 states.
[2022-04-08 04:08:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 04:08:41,571 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions.
[2022-04-08 04:08:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions.
[2022-04-08 04:08:41,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 04:08:41,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 04:08:41,572 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 04:08:41,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 04:08:41,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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-08 04:08:41,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions.
[2022-04-08 04:08:41,573 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 16
[2022-04-08 04:08:41,573 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 04:08:41,574 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions.
[2022-04-08 04:08:41,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 04:08:41,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 26 transitions.
[2022-04-08 04:08:41,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 04:08:41,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions.
[2022-04-08 04:08:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2022-04-08 04:08:41,598 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 04:08:41,598 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 04:08:41,598 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-08 04:08:41,599 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 04:08:41,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 04:08:41,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1509444864, now seen corresponding path program 1 times
[2022-04-08 04:08:41,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 04:08:41,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [926897796]
[2022-04-08 04:08:43,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-08 04:08:43,287 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|]
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.<init>(UnmodifiableTransFormula.java:97)
at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324)
at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201)
at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254)
at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.<init>(AcceleratedInterpolation.java:190)
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.<init>(AutomatonFreeRefinementEngine.java:85)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:82)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175)
at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:154)
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-08 04:08:43,290 INFO L158 Benchmark]: Toolchain (without parser) took 4321.79ms. Allocated memory was 200.3MB in the beginning and 250.6MB in the end (delta: 50.3MB). Free memory was 141.6MB in the beginning and 150.3MB in the end (delta: -8.7MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB.
[2022-04-08 04:08:43,291 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 200.3MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 04:08:43,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.89ms. Allocated memory was 200.3MB in the beginning and 250.6MB in the end (delta: 50.3MB). Free memory was 172.8MB in the beginning and 219.8MB in the end (delta: -47.0MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB.
[2022-04-08 04:08:43,291 INFO L158 Benchmark]: Boogie Preprocessor took 43.82ms. Allocated memory is still 250.6MB. Free memory was 219.8MB in the beginning and 218.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 04:08:43,291 INFO L158 Benchmark]: RCFGBuilder took 354.71ms. Allocated memory is still 250.6MB. Free memory was 218.2MB in the beginning and 206.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 04:08:43,292 INFO L158 Benchmark]: TraceAbstraction took 3631.12ms. Allocated memory is still 250.6MB. Free memory was 206.2MB in the beginning and 150.3MB in the end (delta: 55.9MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB.
[2022-04-08 04:08:43,293 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.13ms. Allocated memory is still 200.3MB. Free memory is still 157.4MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 273.89ms. Allocated memory was 200.3MB in the beginning and 250.6MB in the end (delta: 50.3MB). Free memory was 172.8MB in the beginning and 219.8MB in the end (delta: -47.0MB). Peak memory consumption was 7.4MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 43.82ms. Allocated memory is still 250.6MB. Free memory was 219.8MB in the beginning and 218.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 354.71ms. Allocated memory is still 250.6MB. Free memory was 218.2MB in the beginning and 206.7MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 3631.12ms. Allocated memory is still 250.6MB. Free memory was 206.2MB in the beginning and 150.3MB in the end (delta: 55.9MB). Peak memory consumption was 56.9MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|]
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post8_4|, |v_main_#t~post7_4|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.<init>(UnmodifiableTransFormula.java:97)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
[2022-04-08 04:08:43,309 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...