/usr/bin/java -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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/array-crafted/bAnd5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 09:33:10,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 09:33:10,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 09:33:10,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 09:33:10,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 09:33:10,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 09:33:10,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 09:33:10,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 09:33:10,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 09:33:10,375 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 09:33:10,376 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 09:33:10,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 09:33:10,384 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 09:33:10,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 09:33:10,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 09:33:10,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 09:33:10,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 09:33:10,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 09:33:10,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 09:33:10,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 09:33:10,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 09:33:10,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 09:33:10,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 09:33:10,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 09:33:10,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 09:33:10,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 09:33:10,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 09:33:10,419 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 09:33:10,419 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 09:33:10,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 09:33:10,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 09:33:10,420 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 09:33:10,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 09:33:10,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 09:33:10,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 09:33:10,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 09:33:10,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 09:33:10,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 09:33:10,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 09:33:10,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 09:33:10,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 09:33:10,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 09:33:10,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 09:33:10,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 09:33:10,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 09:33:10,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 09:33:10,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 09:33:10,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 09:33:10,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 09:33:10,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 09:33:10,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 09:33:10,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 09:33:10,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 09:33:10,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 09:33:10,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 09:33:10,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 09:33:10,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 09:33:10,445 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 09:33:10,445 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-01-31 09:33:10,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 09:33:10,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 09:33:10,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 09:33:10,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 09:33:10,659 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 09:33:10,660 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/bAnd5.i [2022-01-31 09:33:10,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8b963ee7/0e2fd96bbf8e4f84a7db47d03d7294cb/FLAGa5499cd21 [2022-01-31 09:33:11,112 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 09:33:11,113 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i [2022-01-31 09:33:11,127 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8b963ee7/0e2fd96bbf8e4f84a7db47d03d7294cb/FLAGa5499cd21 [2022-01-31 09:33:11,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8b963ee7/0e2fd96bbf8e4f84a7db47d03d7294cb [2022-01-31 09:33:11,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 09:33:11,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 09:33:11,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 09:33:11,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 09:33:11,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 09:33:11,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bbd7181 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11, skipping insertion in model container [2022-01-31 09:33:11,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 09:33:11,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 09:33:11,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i[1369,1382] [2022-01-31 09:33:11,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 09:33:11,372 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 09:33:11,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/bAnd5.i[1369,1382] [2022-01-31 09:33:11,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 09:33:11,400 INFO L208 MainTranslator]: Completed translation [2022-01-31 09:33:11,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11 WrapperNode [2022-01-31 09:33:11,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 09:33:11,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 09:33:11,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 09:33:11,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 09:33:11,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,417 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 09:33:11,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 09:33:11,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 09:33:11,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 09:33:11,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 09:33:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 09:33:11,463 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-01-31 09:33:11,471 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-01-31 09:33:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 09:33:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 09:33:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 09:33:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2022-01-31 09:33:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 09:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 09:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 09:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 09:33:11,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 09:33:11,503 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 09:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 09:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 09:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2022-01-31 09:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 09:33:11,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 09:33:11,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 09:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 09:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 09:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 09:33:11,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 09:33:11,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 09:33:11,563 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 09:33:11,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 09:33:11,681 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 09:33:11,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 09:33:11,686 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-31 09:33:11,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:33:11 BoogieIcfgContainer [2022-01-31 09:33:11,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 09:33:11,688 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 09:33:11,688 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 09:33:11,689 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 09:33:11,691 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:33:11" (1/1) ... [2022-01-31 09:33:11,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:33:11 BasicIcfg [2022-01-31 09:33:11,708 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 09:33:11,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 09:33:11,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 09:33:11,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 09:33:11,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:33:11" (1/4) ... [2022-01-31 09:33:11,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1124c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:33:11, skipping insertion in model container [2022-01-31 09:33:11,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:33:11" (2/4) ... [2022-01-31 09:33:11,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1124c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:33:11, skipping insertion in model container [2022-01-31 09:33:11,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:33:11" (3/4) ... [2022-01-31 09:33:11,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1124c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:33:11, skipping insertion in model container [2022-01-31 09:33:11,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 09:33:11" (4/4) ... [2022-01-31 09:33:11,714 INFO L111 eAbstractionObserver]: Analyzing ICFG bAnd5.iJordan [2022-01-31 09:33:11,719 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 09:33:11,719 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 09:33:11,766 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 09:33:11,772 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 09:33:11,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 09:33:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-01-31 09:33:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 09:33:11,815 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 09:33:11,816 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 09:33:11,816 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 09:33:11,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 09:33:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1509444960, now seen corresponding path program 1 times [2022-01-31 09:33:11,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 09:33:11,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354429416] [2022-01-31 09:33:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:11,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 09:33:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 09:33:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:11,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 09:33:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 09:33:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:11,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 09:33:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 09:33:12,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 09:33:12,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354429416] [2022-01-31 09:33:12,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354429416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 09:33:12,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 09:33:12,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 09:33:12,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998476841] [2022-01-31 09:33:12,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 09:33:12,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 09:33:12,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 09:33:12,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 09:33:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 09:33:12,045 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.391304347826087) internal successors, (32), 24 states have internal predecessors, (32), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 09:33:12,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 09:33:12,101 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-01-31 09:33:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 09:33:12,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-01-31 09:33:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 09:33:12,109 INFO L225 Difference]: With dead ends: 33 [2022-01-31 09:33:12,109 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 09:33:12,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 09:33:12,113 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 09:33:12,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 09:33:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 09:33:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-31 09:33:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 09:33:12,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-31 09:33:12,142 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 33 [2022-01-31 09:33:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 09:33:12,143 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-31 09:33:12,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 09:33:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-31 09:33:12,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 09:33:12,144 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 09:33:12,145 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 09:33:12,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 09:33:12,145 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 09:33:12,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 09:33:12,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1653642527, now seen corresponding path program 1 times [2022-01-31 09:33:12,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 09:33:12,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631507618] [2022-01-31 09:33:12,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:12,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 09:33:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 09:33:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 09:33:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 09:33:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 09:33:12,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 09:33:12,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 09:33:12,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631507618] [2022-01-31 09:33:12,272 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631507618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 09:33:12,272 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 09:33:12,272 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 09:33:12,272 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88913986] [2022-01-31 09:33:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 09:33:12,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 09:33:12,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 09:33:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 09:33:12,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 09:33:12,275 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 09:33:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 09:33:12,344 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-01-31 09:33:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 09:33:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 33 [2022-01-31 09:33:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 09:33:12,345 INFO L225 Difference]: With dead ends: 29 [2022-01-31 09:33:12,345 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 09:33:12,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 09:33:12,347 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 09:33:12,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 42 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 09:33:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 09:33:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-01-31 09:33:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 09:33:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-31 09:33:12,353 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 33 [2022-01-31 09:33:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 09:33:12,353 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-31 09:33:12,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 09:33:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-31 09:33:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-31 09:33:12,354 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 09:33:12,354 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 09:33:12,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 09:33:12,355 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 09:33:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 09:33:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash -20218044, now seen corresponding path program 1 times [2022-01-31 09:33:12,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 09:33:12,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141086203] [2022-01-31 09:33:12,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:12,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 09:33:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 09:33:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 09:33:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 09:33:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 09:33:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-31 09:33:12,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 09:33:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141086203] [2022-01-31 09:33:12,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141086203] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 09:33:12,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776717222] [2022-01-31 09:33:12,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:12,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 09:33:12,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 09:33:12,509 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 09:33:12,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-31 09:33:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:12,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-31 09:33:12,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 09:33:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 09:33:12,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 09:33:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-31 09:33:12,882 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776717222] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 09:33:12,882 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 09:33:12,882 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 10 [2022-01-31 09:33:12,883 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392324457] [2022-01-31 09:33:12,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 09:33:12,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 09:33:12,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 09:33:12,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 09:33:12,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-31 09:33:12,885 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 09:33:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 09:33:13,027 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-01-31 09:33:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 09:33:13,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 35 [2022-01-31 09:33:13,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 09:33:13,029 INFO L225 Difference]: With dead ends: 33 [2022-01-31 09:33:13,029 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 09:33:13,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-01-31 09:33:13,033 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 09:33:13,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 66 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 09:33:13,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 09:33:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-01-31 09:33:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 states have internal predecessors, (26), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 09:33:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-01-31 09:33:13,048 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 35 [2022-01-31 09:33:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 09:33:13,048 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-01-31 09:33:13,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 9 states have internal predecessors, (35), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 09:33:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-01-31 09:33:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 09:33:13,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 09:33:13,052 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 09:33:13,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 09:33:13,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 09:33:13,264 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 09:33:13,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 09:33:13,265 INFO L85 PathProgramCache]: Analyzing trace with hash -96915132, now seen corresponding path program 1 times [2022-01-31 09:33:13,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 09:33:13,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291380786] [2022-01-31 09:33:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:13,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 09:33:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:13,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 09:33:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 09:33:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:13,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 09:33:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:13,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 09:33:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-01-31 09:33:13,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 09:33:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291380786] [2022-01-31 09:33:13,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291380786] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 09:33:13,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778887242] [2022-01-31 09:33:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:13,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 09:33:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 09:33:13,377 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 09:33:13,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-31 09:33:13,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 09:33:13,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-31 09:33:13,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 09:33:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-31 09:33:13,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 09:33:13,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778887242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 09:33:13,564 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 09:33:13,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-01-31 09:33:13,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133950607] [2022-01-31 09:33:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 09:33:13,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 09:33:13,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 09:33:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 09:33:13,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-31 09:33:13,566 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 09:33:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 09:33:13,595 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-01-31 09:33:13,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 09:33:13,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2022-01-31 09:33:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 09:33:13,597 INFO L225 Difference]: With dead ends: 33 [2022-01-31 09:33:13,597 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 09:33:13,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-31 09:33:13,598 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 09:33:13,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 09:33:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 09:33:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-01-31 09:33:13,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-01-31 09:33:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-01-31 09:33:13,603 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 43 [2022-01-31 09:33:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 09:33:13,604 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-01-31 09:33:13,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 09:33:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-01-31 09:33:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 09:33:13,605 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 09:33:13,605 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2022-01-31 09:33:13,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-31 09:33:13,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-31 09:33:13,820 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 09:33:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 09:33:13,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1754262783, now seen corresponding path program 1 times [2022-01-31 09:33:13,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 09:33:13,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907543229] [2022-01-31 09:33:13,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 09:33:13,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 09:33:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 09:33:13,878 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-31 09:33:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-31 09:33:13,977 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-31 09:33:13,979 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-31 09:33:13,980 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 09:33:13,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 09:33:13,984 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-01-31 09:33:13,987 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 09:33:14,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:33:14 BasicIcfg [2022-01-31 09:33:14,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 09:33:14,041 INFO L158 Benchmark]: Toolchain (without parser) took 2896.92ms. Allocated memory was 185.6MB in the beginning and 292.6MB in the end (delta: 107.0MB). Free memory was 130.7MB in the beginning and 136.1MB in the end (delta: -5.4MB). Peak memory consumption was 99.7MB. Max. memory is 8.0GB. [2022-01-31 09:33:14,043 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 09:33:14,046 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.60ms. Allocated memory was 185.6MB in the beginning and 292.6MB in the end (delta: 107.0MB). Free memory was 130.5MB in the beginning and 264.6MB in the end (delta: -134.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-01-31 09:33:14,046 INFO L158 Benchmark]: Boogie Preprocessor took 30.24ms. Allocated memory is still 292.6MB. Free memory was 264.6MB in the beginning and 263.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 09:33:14,046 INFO L158 Benchmark]: RCFGBuilder took 254.82ms. Allocated memory is still 292.6MB. Free memory was 263.0MB in the beginning and 249.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 09:33:14,046 INFO L158 Benchmark]: IcfgTransformer took 20.47ms. Allocated memory is still 292.6MB. Free memory was 249.9MB in the beginning and 248.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 09:33:14,047 INFO L158 Benchmark]: TraceAbstraction took 2331.02ms. Allocated memory is still 292.6MB. Free memory was 248.3MB in the beginning and 136.1MB in the end (delta: 112.2MB). Peak memory consumption was 112.2MB. Max. memory is 8.0GB. [2022-01-31 09:33:14,048 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 146.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.60ms. Allocated memory was 185.6MB in the beginning and 292.6MB in the end (delta: 107.0MB). Free memory was 130.5MB in the beginning and 264.6MB in the end (delta: -134.1MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.24ms. Allocated memory is still 292.6MB. Free memory was 264.6MB in the beginning and 263.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.82ms. Allocated memory is still 292.6MB. Free memory was 263.0MB in the beginning and 249.9MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 20.47ms. Allocated memory is still 292.6MB. Free memory was 249.9MB in the beginning and 248.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2331.02ms. Allocated memory is still 292.6MB. Free memory was 248.3MB in the beginning and 136.1MB in the end (delta: 112.2MB). Peak memory consumption was 112.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 57]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 25. Possible FailurePath: [L17] int N; VAL [\old(N)=4294967298, N=0] [L32] N = __VERIFIER_nondet_int() [L33] COND TRUE N > 1 [L34] int x[N]; [L35] int temp; [L36] int ret; [L37] int ret2; [L38] int ret5; [L40] int i = 0; VAL [\old(N)=0, i=0, N=2, x={3:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [\old(N)=0, i=1, N=2, x={3:0}] [L40] COND TRUE i < N [L42] x[i] = __VERIFIER_nondet_int() [L40] i++ VAL [\old(N)=0, i=2, N=2, x={3:0}] [L40] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={3:0}] [L45] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={3:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [\old(N)=0, i=1, N=2, res=-3, x={3:0}, x={3:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res & x[i] [L24] i++ VAL [\old(N)=0, i=2, N=2, x={3:0}, x={3:0}] [L24] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={3:0}, x={3:0}] [L27] return res; VAL [\old(N)=0, \result=-4, i=2, N=2, res=4294967292, x={3:0}, x={3:0}] [L45] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-4, i=2, N=2, x={3:0}] [L45] ret = bAnd(x) [L47] EXPR x[0] [L47] temp=x[0] [L47] EXPR x[1] [L47] x[0] = x[1] [L47] x[1] = temp VAL [\old(N)=0, i=2, N=2, ret=-4, temp=-3, x={3:0}] [L48] CALL, EXPR bAnd(x) VAL [\old(N)=0, N=2, x={3:0}] [L21] int i; [L22] long long res; [L23] EXPR x[0] [L23] res = x[0] [L24] i = 1 VAL [\old(N)=0, i=1, N=2, res=-3, x={3:0}, x={3:0}] [L24] COND TRUE i < N [L25] EXPR x[i] [L25] res = res & x[i] [L24] i++ VAL [\old(N)=0, i=2, N=2, x={3:0}, x={3:0}] [L24] COND FALSE !(i < N) VAL [\old(N)=0, i=2, N=2, x={3:0}, x={3:0}] [L27] return res; VAL [\old(N)=0, \result=-5, i=2, N=2, res=4294967291, x={3:0}, x={3:0}] [L48] RET, EXPR bAnd(x) VAL [\old(N)=0, bAnd(x)=-5, i=2, N=2, ret=-4, temp=-3, x={3:0}] [L48] ret2 = bAnd(x) [L49] EXPR x[0] [L49] temp=x[0] [L50] int i =0 ; VAL [\old(N)=0, i=0, i=2, N=2, ret=-4, ret2=-5, temp=-3, x={3:0}] [L50] COND TRUE i