/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label46.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:21:16,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:21:16,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:21:16,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:21:16,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:21:16,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:21:16,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:21:16,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:21:16,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:21:16,847 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:21:16,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:21:16,850 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:21:16,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:21:16,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:21:16,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:21:16,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:21:16,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:21:16,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:21:16,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:21:16,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:21:16,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:21:16,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:21:16,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:21:16,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:21:16,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:21:16,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:21:16,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:21:16,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:21:16,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:21:16,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:21:16,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:21:16,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:21:16,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:21:16,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:21:16,893 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:21:16,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:21:16,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:21:16,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:21:16,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:21:16,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:21:16,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:21:16,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:21:16,912 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:21:16,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:21:16,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:21:16,915 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:21:16,915 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:21:16,915 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:21:16,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:21:16,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:21:16,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:21:16,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:21:16,916 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:21:16,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:21:16,917 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:21:16,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:21:16,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:21:16,918 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:21:16,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:21:16,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:21:16,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:21:16,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:21:16,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:21:16,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:21:16,920 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.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:21:17,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:21:17,355 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:21:17,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:21:17,360 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:21:17,361 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:21:17,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label46.c [2020-11-07 06:21:17,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54941f31d/4de76d8c3d85434699ba6f037f652a53/FLAGd488746d3 [2020-11-07 06:21:18,218 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:21:18,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem10_label46.c [2020-11-07 06:21:18,239 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54941f31d/4de76d8c3d85434699ba6f037f652a53/FLAGd488746d3 [2020-11-07 06:21:18,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54941f31d/4de76d8c3d85434699ba6f037f652a53 [2020-11-07 06:21:18,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:21:18,485 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:21:18,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:21:18,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:21:18,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:21:18,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:21:18" (1/1) ... [2020-11-07 06:21:18,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c0d6451 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:18, skipping insertion in model container [2020-11-07 06:21:18,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:21:18" (1/1) ... [2020-11-07 06:21:18,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:21:18,550 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:21:19,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:21:19,029 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:21:19,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:21:19,226 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:21:19,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19 WrapperNode [2020-11-07 06:21:19,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:21:19,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:21:19,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:21:19,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:21:19,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... [2020-11-07 06:21:19,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:21:19,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:21:19,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:21:19,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:21:19,407 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:21:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:21:19,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:21:19,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:21:19,491 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-11-07 06:21:19,491 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:21:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-11-07 06:21:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:21:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:21:19,491 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:21:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:21:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:21:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-11-07 06:21:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:21:19,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:21:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:21:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:21:19,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:21:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:21:19,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:21:21,122 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:21:21,123 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:21:21,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:21:21 BoogieIcfgContainer [2020-11-07 06:21:21,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:21:21,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:21:21,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:21:21,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:21:21,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:21:18" (1/3) ... [2020-11-07 06:21:21,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad78939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:21:21, skipping insertion in model container [2020-11-07 06:21:21,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:21:19" (2/3) ... [2020-11-07 06:21:21,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad78939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:21:21, skipping insertion in model container [2020-11-07 06:21:21,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:21:21" (3/3) ... [2020-11-07 06:21:21,135 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label46.c [2020-11-07 06:21:21,152 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:21:21,156 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:21:21,176 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:21:21,202 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:21:21,202 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:21:21,203 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:21:21,203 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:21:21,203 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:21:21,203 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:21:21,203 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:21:21,203 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:21:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states. [2020-11-07 06:21:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-07 06:21:21,242 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:21:21,243 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:21:21,243 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:21:21,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:21:21,250 INFO L82 PathProgramCache]: Analyzing trace with hash -385445948, now seen corresponding path program 1 times [2020-11-07 06:21:21,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:21:21,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377129789] [2020-11-07 06:21:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:21:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:21,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:21:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:21:21,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377129789] [2020-11-07 06:21:21,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:21:21,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:21:21,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858702411] [2020-11-07 06:21:21,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:21:21,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:21:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:21:21,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:21:21,755 INFO L87 Difference]: Start difference. First operand 468 states. Second operand 4 states. [2020-11-07 06:21:24,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:21:24,759 INFO L93 Difference]: Finished difference Result 1173 states and 1599 transitions. [2020-11-07 06:21:24,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-07 06:21:24,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-07 06:21:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:21:24,811 INFO L225 Difference]: With dead ends: 1173 [2020-11-07 06:21:24,811 INFO L226 Difference]: Without dead ends: 640 [2020-11-07 06:21:24,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:21:24,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2020-11-07 06:21:25,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 585. [2020-11-07 06:21:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2020-11-07 06:21:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 717 transitions. [2020-11-07 06:21:25,079 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 717 transitions. Word has length 49 [2020-11-07 06:21:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:21:25,081 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 717 transitions. [2020-11-07 06:21:25,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:21:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 717 transitions. [2020-11-07 06:21:25,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 06:21:25,098 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:21:25,098 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:21:25,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:21:25,100 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:21:25,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:21:25,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1063978668, now seen corresponding path program 1 times [2020-11-07 06:21:25,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:21:25,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [650303206] [2020-11-07 06:21:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:21:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:25,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:21:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:25,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 06:21:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:21:25,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [650303206] [2020-11-07 06:21:25,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:21:25,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-07 06:21:25,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601258192] [2020-11-07 06:21:25,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:21:25,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:21:25,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:21:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:21:25,578 INFO L87 Difference]: Start difference. First operand 585 states and 717 transitions. Second operand 8 states. [2020-11-07 06:21:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:21:28,288 INFO L93 Difference]: Finished difference Result 1497 states and 1942 transitions. [2020-11-07 06:21:28,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:21:28,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 132 [2020-11-07 06:21:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:21:28,301 INFO L225 Difference]: With dead ends: 1497 [2020-11-07 06:21:28,301 INFO L226 Difference]: Without dead ends: 935 [2020-11-07 06:21:28,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:21:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2020-11-07 06:21:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 899. [2020-11-07 06:21:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2020-11-07 06:21:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1136 transitions. [2020-11-07 06:21:28,463 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1136 transitions. Word has length 132 [2020-11-07 06:21:28,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:21:28,464 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 1136 transitions. [2020-11-07 06:21:28,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:21:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1136 transitions. [2020-11-07 06:21:28,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2020-11-07 06:21:28,467 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:21:28,468 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:21:28,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:21:28,468 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:21:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:21:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1412132497, now seen corresponding path program 1 times [2020-11-07 06:21:28,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:21:28,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931013763] [2020-11-07 06:21:28,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:21:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:28,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:21:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:28,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-07 06:21:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:21:28,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:21:28,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931013763] [2020-11-07 06:21:28,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:21:28,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-07 06:21:28,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873400734] [2020-11-07 06:21:28,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:21:28,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:21:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:21:28,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:21:28,796 INFO L87 Difference]: Start difference. First operand 899 states and 1136 transitions. Second operand 7 states. [2020-11-07 06:21:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:21:31,818 INFO L93 Difference]: Finished difference Result 2449 states and 3232 transitions. [2020-11-07 06:21:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:21:31,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2020-11-07 06:21:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:21:31,840 INFO L225 Difference]: With dead ends: 2449 [2020-11-07 06:21:31,840 INFO L226 Difference]: Without dead ends: 1573 [2020-11-07 06:21:31,845 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:21:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2020-11-07 06:21:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1523. [2020-11-07 06:21:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2020-11-07 06:21:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1855 transitions. [2020-11-07 06:21:32,150 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1855 transitions. Word has length 132 [2020-11-07 06:21:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:21:32,151 INFO L481 AbstractCegarLoop]: Abstraction has 1523 states and 1855 transitions. [2020-11-07 06:21:32,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:21:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1855 transitions. [2020-11-07 06:21:32,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2020-11-07 06:21:32,153 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:21:32,154 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:21:32,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:21:32,155 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:21:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:21:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash 131462815, now seen corresponding path program 1 times [2020-11-07 06:21:32,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:21:32,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1476438121] [2020-11-07 06:21:32,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:21:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:21:32,218 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:21:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:21:32,263 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:21:32,341 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:21:32,342 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:21:32,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:21:32,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:21:32 BoogieIcfgContainer [2020-11-07 06:21:32,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:21:32,522 INFO L168 Benchmark]: Toolchain (without parser) took 14041.18 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 130.7 MB in the beginning and 219.2 MB in the end (delta: -88.5 MB). Peak memory consumption was 81.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:21:32,523 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 155.2 MB. Free memory was 130.9 MB in the beginning and 130.8 MB in the end (delta: 102.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:21:32,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.16 ms. Allocated memory is still 155.2 MB. Free memory was 130.0 MB in the beginning and 135.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:21:32,524 INFO L168 Benchmark]: Boogie Preprocessor took 170.74 ms. Allocated memory is still 155.2 MB. Free memory was 134.5 MB in the beginning and 130.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:21:32,525 INFO L168 Benchmark]: RCFGBuilder took 1722.89 ms. Allocated memory is still 155.2 MB. Free memory was 130.3 MB in the beginning and 70.8 MB in the end (delta: 59.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:21:32,526 INFO L168 Benchmark]: TraceAbstraction took 11391.89 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 70.3 MB in the beginning and 219.2 MB in the end (delta: -148.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. [2020-11-07 06:21:32,530 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.24 ms. Allocated memory is still 155.2 MB. Free memory was 130.9 MB in the beginning and 130.8 MB in the end (delta: 102.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 740.16 ms. Allocated memory is still 155.2 MB. Free memory was 130.0 MB in the beginning and 135.1 MB in the end (delta: -5.0 MB). Peak memory consumption was 31.3 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 170.74 ms. Allocated memory is still 155.2 MB. Free memory was 134.5 MB in the beginning and 130.3 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1722.89 ms. Allocated memory is still 155.2 MB. Free memory was 130.3 MB in the beginning and 70.8 MB in the end (delta: 59.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 11391.89 ms. Allocated memory was 155.2 MB in the beginning and 324.0 MB in the end (delta: 168.8 MB). Free memory was 70.3 MB in the beginning and 219.2 MB in the end (delta: -148.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L9] int inputC = 3; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=331521, a10=331512, a12=331518, a19=331510, a4=331522, inputB=331523, inputC=3, inputD=331509, inputE=331519, inputF=331511] [L10] int inputD = 4; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=331521, a10=331512, a12=331518, a19=331510, a4=331522, inputB=331523, inputC=3, inputD=4, inputE=331519, inputF=331511] [L11] int inputE = 5; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=331521, a10=331512, a12=331518, a19=331510, a4=331522, inputB=331523, inputC=3, inputD=4, inputE=5, inputF=331511] [L12] int inputF = 6; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=331521, a10=331512, a12=331518, a19=331510, a4=331522, inputB=331523, inputC=3, inputD=4, inputE=5, inputF=6] [L13] int inputB = 2; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=331521, a10=331512, a12=331518, a19=331510, a4=331522, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L16] int a1 = 23; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=23, a10=331512, a12=331518, a19=331510, a4=331522, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L17] int a19 = 9; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=23, a10=331512, a12=331518, a19=9, a4=331522, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L18] int a10 = 0; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=23, a10=0, a12=331518, a19=9, a4=331522, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L19] int a12 = 0; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=23, a10=0, a12=0, a19=9, a4=331522, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L20] int a4 = 14; VAL [\old(a1)=331521, \old(a10)=331512, \old(a12)=331518, \old(a19)=331510, \old(a4)=331522, \old(inputB)=331523, \old(inputC)=331513, \old(inputD)=331509, \old(inputE)=331519, \old(inputF)=331511, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L581] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L584] COND TRUE 1 VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L587] int input; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L588] input = __VERIFIER_nondet_int() VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, __VERIFIER_nondet_int()=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L71] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L74] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L77] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L80] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L83] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L86] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L89] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L92] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L95] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L98] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L101] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L104] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L107] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L110] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L113] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L116] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L119] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L122] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L125] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L128] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L131] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L134] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L137] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L140] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L143] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L146] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L149] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L152] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L155] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L158] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L161] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L164] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L167] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L170] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L173] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L176] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L179] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L182] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L185] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L188] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L191] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L194] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L197] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L200] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L203] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L207] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L212] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L217] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L222] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L227] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L233] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L238] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L251] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L256] COND TRUE (((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=23, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L257] a1 = (((a1 / 5) + 110755) + 220746) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=331505, a10=0, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L258] a10 = 1 VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=331505, a10=1, a12=0, a19=9, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] a19 = 8 VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L261] return -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=5, \result=-1, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L592] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] output = calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L584] COND TRUE 1 VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L587] int input; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L588] input = __VERIFIER_nondet_int() VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, __VERIFIER_nondet_int()=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L589] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] CALL calculate_output(input) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L23] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L26] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L29] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L35] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L38] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L41] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L44] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L50] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L53] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L56] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L59] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L62] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L65] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L68] COND TRUE (((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, \old(input)=5, a1=331505, a10=1, a12=0, a19=8, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L69] CALL reach_error() VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L4] __assert_fail("0", "Problem10_label46.c", 4, "reach_error") VAL [\old(a1)=331505, \old(a10)=1, \old(a19)=8, a1=331505, a10=1, a12=0, a19=8, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 468 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.1s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 634 SDtfs, 2935 SDslu, 915 SDs, 0 SdLazy, 3447 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 3 MinimizatonAttempts, 141 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 106637 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...