/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/linear_search.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 03:35:07,901 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 03:35:07,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 03:35:07,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 03:35:07,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 03:35:07,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 03:35:07,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 03:35:08,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 03:35:08,004 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 03:35:08,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 03:35:08,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 03:35:08,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 03:35:08,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 03:35:08,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 03:35:08,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 03:35:08,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 03:35:08,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 03:35:08,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 03:35:08,025 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 03:35:08,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 03:35:08,027 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 03:35:08,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 03:35:08,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 03:35:08,050 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 03:35:08,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 03:35:08,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 03:35:08,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 03:35:08,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 03:35:08,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 03:35:08,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 03:35:08,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 03:35:08,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 03:35:08,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 03:35:08,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 03:35:08,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 03:35:08,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 03:35:08,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 03:35:08,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 03:35:08,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 03:35:08,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 03:35:08,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 03:35:08,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 03:35:08,080 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 03:35:08,109 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 03:35:08,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 03:35:08,111 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 03:35:08,111 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-08 03:35:08,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 03:35:08,111 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-08 03:35:08,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 03:35:08,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 03:35:08,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 03:35:08,112 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 03:35:08,112 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 03:35:08,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 03:35:08,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 03:35:08,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 03:35:08,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 03:35:08,114 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 03:35:08,114 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 03:35:08,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 03:35:08,114 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-08 03:35:08,114 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 03:35:08,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 03:35:08,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 03:35:08,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 03:35:08,549 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 03:35:08,564 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 03:35:08,565 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c
[2022-04-08 03:35:08,659 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500698b40/6e5a8387339b4106a8e30cd2e9fe3750/FLAG03b916d58
[2022-04-08 03:35:09,205 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 03:35:09,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c
[2022-04-08 03:35:09,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500698b40/6e5a8387339b4106a8e30cd2e9fe3750/FLAG03b916d58
[2022-04-08 03:35:09,572 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500698b40/6e5a8387339b4106a8e30cd2e9fe3750
[2022-04-08 03:35:09,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 03:35:09,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 03:35:09,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 03:35:09,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 03:35:09,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 03:35:09,609 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:09" (1/1) ...
[2022-04-08 03:35:09,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@789ca236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:09, skipping insertion in model container
[2022-04-08 03:35:09,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:35:09" (1/1) ...
[2022-04-08 03:35:09,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 03:35:09,678 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 03:35:09,943 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/linear_search.c[383,396]
[2022-04-08 03:35:09,981 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 03:35:10,018 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 03:35:10,037 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/linear_search.c[383,396]
[2022-04-08 03:35:10,060 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 03:35:10,079 INFO L208 MainTranslator]: Completed translation
[2022-04-08 03:35:10,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10 WrapperNode
[2022-04-08 03:35:10,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 03:35:10,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 03:35:10,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 03:35:10,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 03:35:10,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,120 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 03:35:10,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 03:35:10,149 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 03:35:10,149 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 03:35:10,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (1/1) ...
[2022-04-08 03:35:10,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 03:35:10,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 03:35:10,201 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 03:35:10,215 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 03:35:10,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 03:35:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 03:35:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 03:35:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 03:35:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search
[2022-04-08 03:35:10,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 03:35:10,259 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2022-04-08 03:35:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 03:35:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 03:35:10,259 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 03:35:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 03:35:10,260 INFO L130 BoogieDeclarations]: Found specification of procedure calloc
[2022-04-08 03:35:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 03:35:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint
[2022-04-08 03:35:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search
[2022-04-08 03:35:10,261 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 03:35:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 03:35:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2022-04-08 03:35:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2022-04-08 03:35:10,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 03:35:10,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 03:35:10,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 03:35:10,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 03:35:10,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 03:35:10,378 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 03:35:10,383 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 03:35:12,856 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 03:35:12,863 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 03:35:12,863 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 03:35:12,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:12 BoogieIcfgContainer
[2022-04-08 03:35:12,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 03:35:12,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 03:35:12,867 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 03:35:12,884 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 03:35:12,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:35:09" (1/3) ...
[2022-04-08 03:35:12,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88beab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:12, skipping insertion in model container
[2022-04-08 03:35:12,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:35:10" (2/3) ...
[2022-04-08 03:35:12,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88beab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:35:12, skipping insertion in model container
[2022-04-08 03:35:12,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:35:12" (3/3) ...
[2022-04-08 03:35:12,886 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c
[2022-04-08 03:35:12,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 03:35:12,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 03:35:12,976 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 03:35:12,981 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 03:35:12,982 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 03:35:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5)
[2022-04-08 03:35:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2022-04-08 03:35:13,015 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:35:13,016 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:35:13,016 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 03:35:13,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:35:13,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 1 times
[2022-04-08 03:35:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:13,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1174525361]
[2022-04-08 03:35:13,051 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:35:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1001129449, now seen corresponding path program 2 times
[2022-04-08 03:35:13,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:35:13,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997957594]
[2022-04-08 03:35:13,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:35:13,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:35:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:35:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:13,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID
[2022-04-08 03:35:13,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-08 03:35:13,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID
[2022-04-08 03:35:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-08 03:35:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:13,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID
[2022-04-08 03:35:13,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-08 03:35:13,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID
[2022-04-08 03:35:13,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-08 03:35:13,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:13,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID
[2022-04-08 03:35:13,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume !true; {38#false} is VALID
[2022-04-08 03:35:13,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID
[2022-04-08 03:35:13,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#false} assume true; {38#false} is VALID
[2022-04-08 03:35:13,632 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID
[2022-04-08 03:35:13,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:35:13,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {37#true} is VALID
[2022-04-08 03:35:13,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-08 03:35:13,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #72#return; {37#true} is VALID
[2022-04-08 03:35:13,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret10 := main(); {37#true} is VALID
[2022-04-08 03:35:13,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {37#true} is VALID
[2022-04-08 03:35:13,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {37#true} is VALID
[2022-04-08 03:35:13,637 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {51#(= |#memory_int| |old(#memory_int)|)} is VALID
[2022-04-08 03:35:13,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {37#true} is VALID
[2022-04-08 03:35:13,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume true; {37#true} is VALID
[2022-04-08 03:35:13,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#true} {37#true} #66#return; {37#true} is VALID
[2022-04-08 03:35:13,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {37#true} is VALID
[2022-04-08 03:35:13,640 INFO L272 TraceCheckUtils]: 12: Hoare triple {37#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {37#true} is VALID
[2022-04-08 03:35:13,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {37#true} is VALID
[2022-04-08 03:35:13,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume !true; {38#false} is VALID
[2022-04-08 03:35:13,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {38#false} is VALID
[2022-04-08 03:35:13,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} assume true; {38#false} is VALID
[2022-04-08 03:35:13,642 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {38#false} {37#true} #68#return; {38#false} is VALID
[2022-04-08 03:35:13,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {38#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {38#false} is VALID
[2022-04-08 03:35:13,643 INFO L272 TraceCheckUtils]: 19: Hoare triple {38#false} call __VERIFIER_assert(#t~ret9); {38#false} is VALID
[2022-04-08 03:35:13,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID
[2022-04-08 03:35:13,644 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID
[2022-04-08 03:35:13,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} assume !false; {38#false} is VALID
[2022-04-08 03:35:13,645 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 03:35:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:35:13,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997957594]
[2022-04-08 03:35:13,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997957594] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:35:13,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:35:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 03:35:13,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:35:13,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1174525361]
[2022-04-08 03:35:13,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1174525361] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:35:13,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:35:13,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2022-04-08 03:35:13,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566476742]
[2022-04-08 03:35:13,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:35:13,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2022-04-08 03:35:13,664 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:35:13,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:13,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:13,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2022-04-08 03:35:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-04-08 03:35:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2022-04-08 03:35:13,747 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 23 states have internal predecessors, (30), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:14,046 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions.
[2022-04-08 03:35:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 03:35:14,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23
[2022-04-08 03:35:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:35:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:14,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions.
[2022-04-08 03:35:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions.
[2022-04-08 03:35:14,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 60 transitions.
[2022-04-08 03:35:14,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:14,153 INFO L225 Difference]: With dead ends: 52
[2022-04-08 03:35:14,154 INFO L226 Difference]: Without dead ends: 27
[2022-04-08 03:35:14,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 03:35:14,162 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2022-04-08 03:35:14,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 39 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2022-04-08 03:35:14,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-08 03:35:14,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-08 03:35:14,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:35:14,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:14,220 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:14,220 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:14,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:14,223 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions.
[2022-04-08 03:35:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2022-04-08 03:35:14,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:35:14,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:35:14,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states.
[2022-04-08 03:35:14,225 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states.
[2022-04-08 03:35:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:14,239 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions.
[2022-04-08 03:35:14,240 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2022-04-08 03:35:14,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:35:14,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:35:14,241 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:35:14,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:35:14,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions.
[2022-04-08 03:35:14,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23
[2022-04-08 03:35:14,251 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:35:14,251 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions.
[2022-04-08 03:35:14,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:14,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 30 transitions.
[2022-04-08 03:35:14,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions.
[2022-04-08 03:35:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 03:35:14,296 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:35:14,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:35:14,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 03:35:14,300 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 03:35:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:35:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 1 times
[2022-04-08 03:35:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:14,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1065004094]
[2022-04-08 03:35:14,304 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:35:14,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2092261110, now seen corresponding path program 2 times
[2022-04-08 03:35:14,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:35:14,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838665577]
[2022-04-08 03:35:14,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:35:14,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:35:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:14,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:35:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:14,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {269#true} is VALID
[2022-04-08 03:35:14,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-08 03:35:14,670 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID
[2022-04-08 03:35:14,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-08 03:35:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:14,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {288#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {269#true} is VALID
[2022-04-08 03:35:14,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-08 03:35:14,698 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID
[2022-04-08 03:35:14,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-08 03:35:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:14,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {269#true} is VALID
[2022-04-08 03:35:14,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID
[2022-04-08 03:35:14,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {269#true} is VALID
[2022-04-08 03:35:14,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID
[2022-04-08 03:35:14,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {269#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID
[2022-04-08 03:35:14,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID
[2022-04-08 03:35:14,827 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {269#true} #68#return; {284#(= |main_#t~ret9| 1)} is VALID
[2022-04-08 03:35:14,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:35:14,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {269#true} is VALID
[2022-04-08 03:35:14,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-08 03:35:14,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #72#return; {269#true} is VALID
[2022-04-08 03:35:14,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret10 := main(); {269#true} is VALID
[2022-04-08 03:35:14,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {269#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {269#true} is VALID
[2022-04-08 03:35:14,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {269#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {269#true} is VALID
[2022-04-08 03:35:14,834 INFO L272 TraceCheckUtils]: 7: Hoare triple {269#true} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {288#(= |#memory_int| |old(#memory_int)|)} is VALID
[2022-04-08 03:35:14,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {269#true} is VALID
[2022-04-08 03:35:14,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {269#true} assume true; {269#true} is VALID
[2022-04-08 03:35:14,836 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {269#true} {269#true} #66#return; {269#true} is VALID
[2022-04-08 03:35:14,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {269#true} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {269#true} is VALID
[2022-04-08 03:35:14,837 INFO L272 TraceCheckUtils]: 12: Hoare triple {269#true} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {269#true} is VALID
[2022-04-08 03:35:14,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {269#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {269#true} is VALID
[2022-04-08 03:35:14,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#true} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {269#true} is VALID
[2022-04-08 03:35:14,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#true} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {269#true} is VALID
[2022-04-08 03:35:14,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#true} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {269#true} is VALID
[2022-04-08 03:35:14,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {269#true} assume ~j~0 % 4294967296 < ~SIZE~0 % 4294967296;#res := 1; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID
[2022-04-08 03:35:14,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} assume true; {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} is VALID
[2022-04-08 03:35:14,840 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {289#(and (<= |linear_search_#res| 1) (<= 1 |linear_search_#res|))} {269#true} #68#return; {284#(= |main_#t~ret9| 1)} is VALID
[2022-04-08 03:35:14,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {284#(= |main_#t~ret9| 1)} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {284#(= |main_#t~ret9| 1)} is VALID
[2022-04-08 03:35:14,842 INFO L272 TraceCheckUtils]: 21: Hoare triple {284#(= |main_#t~ret9| 1)} call __VERIFIER_assert(#t~ret9); {285#(= |__VERIFIER_assert_#in~cond| 1)} is VALID
[2022-04-08 03:35:14,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {286#(= __VERIFIER_assert_~cond 1)} is VALID
[2022-04-08 03:35:14,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {286#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {270#false} is VALID
[2022-04-08 03:35:14,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {270#false} assume !false; {270#false} is VALID
[2022-04-08 03:35:14,843 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 03:35:14,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:35:14,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838665577]
[2022-04-08 03:35:14,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838665577] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:35:14,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:35:14,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 03:35:14,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:35:14,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1065004094]
[2022-04-08 03:35:14,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1065004094] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:35:14,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:35:14,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 03:35:14,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675832469]
[2022-04-08 03:35:14,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:35:14,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25
[2022-04-08 03:35:14,858 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:35:14,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:14,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:14,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 03:35:14,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:14,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 03:35:14,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2022-04-08 03:35:14,900 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:15,651 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions.
[2022-04-08 03:35:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2022-04-08 03:35:15,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25
[2022-04-08 03:35:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:35:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:15,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions.
[2022-04-08 03:35:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:15,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions.
[2022-04-08 03:35:15,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 37 transitions.
[2022-04-08 03:35:15,720 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 03:35:15,721 INFO L225 Difference]: With dead ends: 35
[2022-04-08 03:35:15,721 INFO L226 Difference]: Without dead ends: 27
[2022-04-08 03:35:15,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132
[2022-04-08 03:35:15,723 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2022-04-08 03:35:15,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2022-04-08 03:35:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2022-04-08 03:35:15,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27.
[2022-04-08 03:35:15,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:35:15,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:15,736 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:15,736 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:15,738 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions.
[2022-04-08 03:35:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2022-04-08 03:35:15,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:35:15,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:35:15,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states.
[2022-04-08 03:35:15,739 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states.
[2022-04-08 03:35:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:15,741 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions.
[2022-04-08 03:35:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2022-04-08 03:35:15,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:35:15,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:35:15,741 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:35:15,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:35:15,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions.
[2022-04-08 03:35:15,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25
[2022-04-08 03:35:15,759 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:35:15,759 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions.
[2022-04-08 03:35:15,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)
[2022-04-08 03:35:15,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions.
[2022-04-08 03:35:15,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions.
[2022-04-08 03:35:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-08 03:35:15,810 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:35:15,810 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:35:15,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2022-04-08 03:35:15,810 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 03:35:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:35:15,811 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 1 times
[2022-04-08 03:35:15,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:15,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [153839510]
[2022-04-08 03:35:15,812 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 03:35:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -349450775, now seen corresponding path program 2 times
[2022-04-08 03:35:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 03:35:15,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989956749]
[2022-04-08 03:35:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 03:35:15,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 03:35:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 03:35:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:16,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {479#true} is VALID
[2022-04-08 03:35:16,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-08 03:35:16,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID
[2022-04-08 03:35:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2022-04-08 03:35:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:16,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {496#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {479#true} is VALID
[2022-04-08 03:35:16,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-08 03:35:16,060 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {479#true} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID
[2022-04-08 03:35:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12
[2022-04-08 03:35:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 03:35:16,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID
[2022-04-08 03:35:16,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID
[2022-04-08 03:35:16,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID
[2022-04-08 03:35:16,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID
[2022-04-08 03:35:16,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID
[2022-04-08 03:35:16,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID
[2022-04-08 03:35:16,243 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {480#false} is VALID
[2022-04-08 03:35:16,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 03:35:16,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#(and (= |old(~SIZE~0)| ~SIZE~0) (= ~MAX~0 |old(~MAX~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {479#true} is VALID
[2022-04-08 03:35:16,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-08 03:35:16,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #72#return; {479#true} is VALID
[2022-04-08 03:35:16,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret10 := main(); {479#true} is VALID
[2022-04-08 03:35:16,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {479#true} ~SIZE~0 := 1 + (if #t~nondet7 % 4294967296 < 0 && 0 != #t~nondet7 % 4294967296 % 2 then 1 + #t~nondet7 % 4294967296 / 2 else #t~nondet7 % 4294967296 / 2);havoc #t~nondet7; {479#true} is VALID
[2022-04-08 03:35:16,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {479#true} assume ~SIZE~0 % 4294967296 > 1 && ~SIZE~0 % 4294967296 < ~MAX~0 % 4294967296;call #t~malloc8.base, #t~malloc8.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0); {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID
[2022-04-08 03:35:16,248 INFO L272 TraceCheckUtils]: 7: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #Ultimate.meminit(#t~malloc8.base, #t~malloc8.offset, ~SIZE~0, 4, 4 * ~SIZE~0); {496#(= |#memory_int| |old(#memory_int)|)} is VALID
[2022-04-08 03:35:16,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {496#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {479#true} is VALID
[2022-04-08 03:35:16,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {479#true} assume true; {479#true} is VALID
[2022-04-08 03:35:16,250 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {479#true} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #66#return; {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID
[2022-04-08 03:35:16,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} ~a~0.base, ~a~0.offset := #t~malloc8.base, #t~malloc8.offset;call write~int(3, ~a~0.base, ~a~0.offset + 4 * (if (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 else (if ~SIZE~0 % 4294967296 < 0 && 0 != ~SIZE~0 % 4294967296 % 2 then 1 + ~SIZE~0 % 4294967296 / 2 else ~SIZE~0 % 4294967296 / 2) % 4294967296 % 4294967296 - 4294967296), 4); {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} is VALID
[2022-04-08 03:35:16,251 INFO L272 TraceCheckUtils]: 12: Hoare triple {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} call #t~ret9 := linear_search(~a~0.base, ~a~0.offset, (if ~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then ~SIZE~0 % 4294967296 % 4294967296 else ~SIZE~0 % 4294967296 % 4294967296 - 4294967296), 3); {479#true} is VALID
[2022-04-08 03:35:16,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {479#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~n := #in~n;~q := #in~q;~j~0 := 0; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID
[2022-04-08 03:35:16,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} #t~short5 := ~j~0 % 4294967296 < ~n % 4294967296; {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} is VALID
[2022-04-08 03:35:16,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#(or (and (<= linear_search_~j~0 0) (< 0 (+ (div linear_search_~j~0 4294967296) 1))) (not |linear_search_#t~short5|))} assume #t~short5;call #t~mem4 := read~int(~a.base, ~a.offset + 4 * (if ~j~0 % 4294967296 % 4294967296 <= 2147483647 then ~j~0 % 4294967296 % 4294967296 else ~j~0 % 4294967296 % 4294967296 - 4294967296), 4);#t~short5 := #t~mem4 != ~q; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID
[2022-04-08 03:35:16,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} is VALID
[2022-04-08 03:35:16,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {497#(and (<= linear_search_~j~0 0) (not (<= (+ (div linear_search_~j~0 4294967296) 1) 0)))} assume !(~j~0 % 4294967296 < ~SIZE~0 % 4294967296);#res := 0; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID
[2022-04-08 03:35:16,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} assume true; {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} is VALID
[2022-04-08 03:35:16,260 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {499#(<= ~SIZE~0 (* (div ~SIZE~0 4294967296) 4294967296))} {484#(<= (+ 2 (* (div ~SIZE~0 4294967296) 4294967296)) ~SIZE~0)} #68#return; {480#false} is VALID
[2022-04-08 03:35:16,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {480#false} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; {480#false} is VALID
[2022-04-08 03:35:16,261 INFO L272 TraceCheckUtils]: 21: Hoare triple {480#false} call __VERIFIER_assert(#t~ret9); {480#false} is VALID
[2022-04-08 03:35:16,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {480#false} ~cond := #in~cond; {480#false} is VALID
[2022-04-08 03:35:16,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {480#false} assume 0 == ~cond; {480#false} is VALID
[2022-04-08 03:35:16,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {480#false} assume !false; {480#false} is VALID
[2022-04-08 03:35:16,262 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 03:35:16,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 03:35:16,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989956749]
[2022-04-08 03:35:16,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989956749] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:35:16,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:35:16,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 03:35:16,264 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 03:35:16,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [153839510]
[2022-04-08 03:35:16,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [153839510] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 03:35:16,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 03:35:16,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-08 03:35:16,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100595675]
[2022-04-08 03:35:16,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 03:35:16,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25
[2022-04-08 03:35:16,265 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 03:35:16,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 03:35:16,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:16,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-08 03:35:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:16,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-08 03:35:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2022-04-08 03:35:16,299 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 03:35:20,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []
[2022-04-08 03:35:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:21,647 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions.
[2022-04-08 03:35:21,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2022-04-08 03:35:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25
[2022-04-08 03:35:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 03:35:21,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 03:35:21,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions.
[2022-04-08 03:35:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 03:35:21,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions.
[2022-04-08 03:35:21,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions.
[2022-04-08 03:35:21,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:21,757 INFO L225 Difference]: With dead ends: 40
[2022-04-08 03:35:21,757 INFO L226 Difference]: Without dead ends: 31
[2022-04-08 03:35:21,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240
[2022-04-08 03:35:21,758 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2022-04-08 03:35:21,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 38 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time]
[2022-04-08 03:35:21,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2022-04-08 03:35:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30.
[2022-04-08 03:35:21,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 03:35:21,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:21,798 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:21,798 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:21,804 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions.
[2022-04-08 03:35:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions.
[2022-04-08 03:35:21,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:35:21,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:35:21,805 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states.
[2022-04-08 03:35:21,805 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states.
[2022-04-08 03:35:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 03:35:21,824 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions.
[2022-04-08 03:35:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions.
[2022-04-08 03:35:21,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 03:35:21,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 03:35:21,826 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 03:35:21,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 03:35:21,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2022-04-08 03:35:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions.
[2022-04-08 03:35:21,831 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25
[2022-04-08 03:35:21,831 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 03:35:21,831 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions.
[2022-04-08 03:35:21,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3)
[2022-04-08 03:35:21,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions.
[2022-04-08 03:35:21,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 03:35:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions.
[2022-04-08 03:35:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2022-04-08 03:35:21,905 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 03:35:21,905 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 03:35:21,905 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2022-04-08 03:35:21,905 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 03:35:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 03:35:21,906 INFO L85 PathProgramCache]: Analyzing trace with hash 33102019, now seen corresponding path program 1 times
[2022-04-08 03:35:21,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 03:35:21,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2121302698]
[2022-04-08 03:35:22,870 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult
[2022-04-08 03:35:22,873 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.AssertionError: free variables [|v_linear_search_#t~post6_4|, |v_linear_search_#t~mem4_6|, |v_linear_search_#t~short5_16|]
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 03:35:22,877 INFO L158 Benchmark]: Toolchain (without parser) took 13301.11ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 127.7MB in the beginning and 115.3MB in the end (delta: 12.4MB). Peak memory consumption was 47.8MB. Max. memory is 8.0GB.
[2022-04-08 03:35:22,877 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 177.2MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 03:35:22,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.58ms. Allocated memory is still 177.2MB. Free memory was 127.5MB in the beginning and 154.3MB in the end (delta: -26.8MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB.
[2022-04-08 03:35:22,878 INFO L158 Benchmark]: Boogie Preprocessor took 66.95ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 152.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2022-04-08 03:35:22,878 INFO L158 Benchmark]: RCFGBuilder took 2716.35ms. Allocated memory is still 177.2MB. Free memory was 152.2MB in the beginning and 138.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2022-04-08 03:35:22,879 INFO L158 Benchmark]: TraceAbstraction took 10009.25ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 138.1MB in the beginning and 115.3MB in the end (delta: 22.8MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB.
[2022-04-08 03:35:22,880 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.15ms. Allocated memory is still 177.2MB. Free memory is still 143.9MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 493.58ms. Allocated memory is still 177.2MB. Free memory was 127.5MB in the beginning and 154.3MB in the end (delta: -26.8MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 66.95ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 152.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
* RCFGBuilder took 2716.35ms. Allocated memory is still 177.2MB. Free memory was 152.2MB in the beginning and 138.6MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
* TraceAbstraction took 10009.25ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 138.1MB in the beginning and 115.3MB in the end (delta: 22.8MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- ExceptionOrErrorResult: AssertionError: free variables [|v_linear_search_#t~post6_4|, |v_linear_search_#t~mem4_6|, |v_linear_search_#t~short5_16|]
de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_linear_search_#t~post6_4|, |v_linear_search_#t~mem4_6|, |v_linear_search_#t~short5_16|]: 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 03:35:22,917 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...