/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --rcfgbuilder.size.of.a.code.block SingleStatement --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options produce-proofs=true --traceabstraction.additional.smt.options produce-unsat-cores=true --traceabstraction.additional.smt.options enumeration-timeout=5000 --traceabstraction.additional.smt.options interpolation-heuristic=LOWLEXORDER --traceabstraction.additional.smt.options log-additional-information=true -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c90d42b [2020-09-24 21:45:40,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-24 21:45:40,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-24 21:45:40,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-24 21:45:40,256 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-24 21:45:40,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-24 21:45:40,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-24 21:45:40,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-24 21:45:40,276 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-24 21:45:40,278 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-24 21:45:40,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-24 21:45:40,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-24 21:45:40,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-24 21:45:40,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-24 21:45:40,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-24 21:45:40,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-24 21:45:40,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-24 21:45:40,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-24 21:45:40,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-24 21:45:40,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-24 21:45:40,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-24 21:45:40,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-24 21:45:40,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-24 21:45:40,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-24 21:45:40,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-24 21:45:40,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-24 21:45:40,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-24 21:45:40,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-24 21:45:40,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-24 21:45:40,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-24 21:45:40,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-24 21:45:40,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-24 21:45:40,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-24 21:45:40,318 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-24 21:45:40,319 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-24 21:45:40,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-24 21:45:40,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-24 21:45:40,321 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-24 21:45:40,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-24 21:45:40,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-24 21:45:40,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-24 21:45:40,325 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-24 21:45:40,374 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-24 21:45:40,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-24 21:45:40,377 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-24 21:45:40,377 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-24 21:45:40,377 INFO L138 SettingsManager]: * Use SBE=true [2020-09-24 21:45:40,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-24 21:45:40,378 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-24 21:45:40,378 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-24 21:45:40,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-24 21:45:40,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-24 21:45:40,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-24 21:45:40,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-24 21:45:40,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-24 21:45:40,381 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-24 21:45:40,381 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-24 21:45:40,381 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-24 21:45:40,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-24 21:45:40,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-24 21:45:40,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-24 21:45:40,382 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-24 21:45:40,382 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-24 21:45:40,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-24 21:45:40,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-24 21:45:40,383 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-24 21:45:40,383 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-24 21:45:40,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-24 21:45:40,383 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-24 21:45:40,384 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-24 21:45:40,384 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-24 21:45:40,384 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES 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: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> produce-proofs=true;produce-unsat-cores=true;enumeration-timeout=5000;interpolation-heuristic=LOWLEXORDER;log-additional-information=true; [2020-09-24 21:45:40,833 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-24 21:45:40,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-24 21:45:40,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-24 21:45:40,857 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-24 21:45:40,858 INFO L275 PluginConnector]: CDTParser initialized [2020-09-24 21:45:40,859 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-24 21:45:40,956 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3a4875c01/0b867b9be83342e28f35f09d590bc23a/FLAGd36a141ad [2020-09-24 21:45:41,593 INFO L306 CDTParser]: Found 1 translation units. [2020-09-24 21:45:41,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/eca-rers2012/Problem10_label42.c [2020-09-24 21:45:41,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3a4875c01/0b867b9be83342e28f35f09d590bc23a/FLAGd36a141ad [2020-09-24 21:45:41,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3a4875c01/0b867b9be83342e28f35f09d590bc23a [2020-09-24 21:45:41,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-24 21:45:41,863 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-24 21:45:41,864 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-24 21:45:41,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-24 21:45:41,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-24 21:45:41,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 09:45:41" (1/1) ... [2020-09-24 21:45:41,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb7919e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:41, skipping insertion in model container [2020-09-24 21:45:41,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.09 09:45:41" (1/1) ... [2020-09-24 21:45:41,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-24 21:45:41,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-24 21:45:42,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 21:45:42,440 INFO L203 MainTranslator]: Completed pre-run [2020-09-24 21:45:42,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-24 21:45:42,698 INFO L208 MainTranslator]: Completed translation [2020-09-24 21:45:42,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42 WrapperNode [2020-09-24 21:45:42,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-24 21:45:42,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-24 21:45:42,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-24 21:45:42,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-24 21:45:42,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... [2020-09-24 21:45:42,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-24 21:45:42,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-24 21:45:42,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-24 21:45:42,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-24 21:45:42,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-24 21:45:42,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-24 21:45:42,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-24 21:45:42,932 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2020-09-24 21:45:42,932 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-24 21:45:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2020-09-24 21:45:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-24 21:45:42,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-24 21:45:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-09-24 21:45:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-24 21:45:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-24 21:45:42,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-24 21:45:44,445 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-24 21:45:44,445 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-09-24 21:45:44,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 09:45:44 BoogieIcfgContainer [2020-09-24 21:45:44,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-24 21:45:44,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-24 21:45:44,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-24 21:45:44,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-24 21:45:44,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.09 09:45:41" (1/3) ... [2020-09-24 21:45:44,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600cbf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 09:45:44, skipping insertion in model container [2020-09-24 21:45:44,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.09 09:45:42" (2/3) ... [2020-09-24 21:45:44,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@600cbf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.09 09:45:44, skipping insertion in model container [2020-09-24 21:45:44,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.09 09:45:44" (3/3) ... [2020-09-24 21:45:44,466 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem10_label42.c [2020-09-24 21:45:44,482 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-24 21:45:44,495 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-24 21:45:44,522 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-24 21:45:44,563 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-24 21:45:44,564 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-24 21:45:44,564 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-24 21:45:44,564 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-24 21:45:44,564 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-24 21:45:44,565 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-24 21:45:44,565 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-24 21:45:44,565 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-24 21:45:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states. [2020-09-24 21:45:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-24 21:45:44,610 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 21:45:44,612 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] [2020-09-24 21:45:44,612 INFO L427 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 21:45:44,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 21:45:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash 969247631, now seen corresponding path program 1 times [2020-09-24 21:45:44,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 21:45:44,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1079871953] [2020-09-24 21:45:44,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 21:45:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:44,924 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:45,177 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:45,581 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:45,581 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 45 [2020-09-24 21:45:45,581 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-24 21:45:45,582 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 751 [2020-09-24 21:45:45,585 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:45,585 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 6 [2020-09-24 21:45:45,586 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-24 21:45:45,586 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 33 [2020-09-24 21:45:45,586 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 4 [2020-09-24 21:45:45,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 21:45:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:45,704 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:45,724 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:45,724 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 21:45:45,724 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 21:45:45,725 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 23 [2020-09-24 21:45:45,725 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:45,725 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 21:45:45,726 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 21:45:45,726 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 7 [2020-09-24 21:45:45,726 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 21:45:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 21:45:45,749 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1079871953] [2020-09-24 21:45:45,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-24 21:45:45,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-09-24 21:45:45,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607299160] [2020-09-24 21:45:45,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-24 21:45:45,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 21:45:45,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-24 21:45:45,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-24 21:45:45,785 INFO L87 Difference]: Start difference. First operand 456 states. Second operand 4 states. [2020-09-24 21:45:47,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 21:45:47,797 INFO L93 Difference]: Finished difference Result 1104 states and 1521 transitions. [2020-09-24 21:45:47,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-24 21:45:47,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-09-24 21:45:47,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 21:45:47,825 INFO L225 Difference]: With dead ends: 1104 [2020-09-24 21:45:47,825 INFO L226 Difference]: Without dead ends: 578 [2020-09-24 21:45:47,837 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-09-24 21:45:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2020-09-24 21:45:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 544. [2020-09-24 21:45:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2020-09-24 21:45:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 655 transitions. [2020-09-24 21:45:47,939 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 655 transitions. Word has length 36 [2020-09-24 21:45:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 21:45:47,940 INFO L479 AbstractCegarLoop]: Abstraction has 544 states and 655 transitions. [2020-09-24 21:45:47,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-24 21:45:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 655 transitions. [2020-09-24 21:45:47,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-09-24 21:45:47,946 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 21:45:47,947 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 21:45:47,947 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-24 21:45:47,948 INFO L427 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 21:45:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 21:45:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2117330465, now seen corresponding path program 1 times [2020-09-24 21:45:47,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 21:45:47,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1284508031] [2020-09-24 21:45:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 21:45:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:48,035 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:48,119 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:48,261 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:48,323 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:48,492 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:49,276 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:49,550 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:53,005 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:53,006 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 126 [2020-09-24 21:45:53,006 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 7 [2020-09-24 21:45:53,006 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 5004 [2020-09-24 21:45:53,007 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:53,007 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 10 [2020-09-24 21:45:53,007 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 11 [2020-09-24 21:45:53,008 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 114 [2020-09-24 21:45:53,008 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 21:45:53,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 21:45:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:53,105 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:53,129 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:53,130 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 21:45:53,130 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 21:45:53,130 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 27 [2020-09-24 21:45:53,130 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:53,131 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 3 [2020-09-24 21:45:53,131 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 21:45:53,131 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 9 [2020-09-24 21:45:53,132 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 21:45:53,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 21:45:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:53,193 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:53,277 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:53,380 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:53,381 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 75 [2020-09-24 21:45:53,381 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 2 [2020-09-24 21:45:53,381 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 203 [2020-09-24 21:45:53,381 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:53,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 5 [2020-09-24 21:45:53,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 1 [2020-09-24 21:45:53,382 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 74 [2020-09-24 21:45:53,383 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 1 [2020-09-24 21:45:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 21:45:53,648 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1284508031] [2020-09-24 21:45:53,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 21:45:53,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-24 21:45:53,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190112765] [2020-09-24 21:45:53,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-24 21:45:53,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 21:45:53,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-24 21:45:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-09-24 21:45:53,654 INFO L87 Difference]: Start difference. First operand 544 states and 655 transitions. Second operand 9 states. [2020-09-24 21:45:57,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 21:45:57,040 INFO L93 Difference]: Finished difference Result 1290 states and 1601 transitions. [2020-09-24 21:45:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-24 21:45:57,041 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2020-09-24 21:45:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 21:45:57,047 INFO L225 Difference]: With dead ends: 1290 [2020-09-24 21:45:57,047 INFO L226 Difference]: Without dead ends: 761 [2020-09-24 21:45:57,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2020-09-24 21:45:57,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2020-09-24 21:45:57,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 697. [2020-09-24 21:45:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2020-09-24 21:45:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 863 transitions. [2020-09-24 21:45:57,095 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 863 transitions. Word has length 115 [2020-09-24 21:45:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 21:45:57,096 INFO L479 AbstractCegarLoop]: Abstraction has 697 states and 863 transitions. [2020-09-24 21:45:57,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-24 21:45:57,096 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 863 transitions. [2020-09-24 21:45:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-24 21:45:57,106 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 21:45:57,106 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-09-24 21:45:57,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-24 21:45:57,109 INFO L427 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 21:45:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 21:45:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1359994051, now seen corresponding path program 1 times [2020-09-24 21:45:57,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 21:45:57,111 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1789758761] [2020-09-24 21:45:57,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 21:45:57,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:57,187 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:57,493 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:57,493 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 136 [2020-09-24 21:45:57,493 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 21:45:57,493 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 336 [2020-09-24 21:45:57,494 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:57,494 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 4 [2020-09-24 21:45:57,494 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 105 [2020-09-24 21:45:57,494 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 30 [2020-09-24 21:45:57,494 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 21:45:57,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-24 21:45:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:57,563 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:57,571 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:57,572 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 18 [2020-09-24 21:45:57,572 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 21:45:57,572 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 9 [2020-09-24 21:45:57,574 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:57,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 1 [2020-09-24 21:45:57,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 21:45:57,574 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 1 [2020-09-24 21:45:57,575 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 2 [2020-09-24 21:45:57,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-09-24 21:45:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-24 21:45:57,621 FATAL L256 erpolLogProxyWrapper]: Now shrinking... [2020-09-24 21:45:57,703 FATAL L256 erpolLogProxyWrapper]: Timeout: 5000 [2020-09-24 21:45:57,704 FATAL L256 erpolLogProxyWrapper]: Cardinality of Constraint set: 85 [2020-09-24 21:45:57,704 FATAL L256 erpolLogProxyWrapper]: Number of enumerated Muses: 1 [2020-09-24 21:45:57,704 FATAL L256 erpolLogProxyWrapper]: Time needed for enumeration: 97 [2020-09-24 21:45:57,705 FATAL L256 erpolLogProxyWrapper]: Heuristic: LOWLEXORDER [2020-09-24 21:45:57,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has size: 2 [2020-09-24 21:45:57,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has depth: 2 [2020-09-24 21:45:57,705 FATAL L256 erpolLogProxyWrapper]: Chosen Mus has width: 76 [2020-09-24 21:45:57,706 FATAL L256 erpolLogProxyWrapper]: Time needed for Heuristics: 0 [2020-09-24 21:45:57,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-24 21:45:57,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1789758761] [2020-09-24 21:45:57,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-24 21:45:57,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-24 21:45:57,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787289193] [2020-09-24 21:45:57,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-24 21:45:57,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-24 21:45:57,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-24 21:45:57,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-09-24 21:45:57,791 INFO L87 Difference]: Start difference. First operand 697 states and 863 transitions. Second operand 5 states. [2020-09-24 21:45:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-24 21:45:59,501 INFO L93 Difference]: Finished difference Result 1555 states and 2048 transitions. [2020-09-24 21:45:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-24 21:45:59,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2020-09-24 21:45:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-24 21:45:59,511 INFO L225 Difference]: With dead ends: 1555 [2020-09-24 21:45:59,512 INFO L226 Difference]: Without dead ends: 1023 [2020-09-24 21:45:59,514 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-09-24 21:45:59,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2020-09-24 21:45:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1001. [2020-09-24 21:45:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1001 states. [2020-09-24 21:45:59,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1312 transitions. [2020-09-24 21:45:59,563 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1312 transitions. Word has length 125 [2020-09-24 21:45:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-24 21:45:59,567 INFO L479 AbstractCegarLoop]: Abstraction has 1001 states and 1312 transitions. [2020-09-24 21:45:59,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-24 21:45:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1312 transitions. [2020-09-24 21:45:59,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2020-09-24 21:45:59,580 INFO L414 BasicCegarLoop]: Found error trace [2020-09-24 21:45:59,581 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2020-09-24 21:45:59,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-24 21:45:59,581 INFO L427 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-24 21:45:59,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-24 21:45:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1776525167, now seen corresponding path program 1 times [2020-09-24 21:45:59,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-24 21:45:59,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1613722678] [2020-09-24 21:45:59,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-24 21:45:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-24 21:45:59,657 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-24 21:45:59,658 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-24 21:45:59,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-24 21:45:59,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.09 09:45:59 BoogieIcfgContainer [2020-09-24 21:45:59,724 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-24 21:45:59,728 INFO L168 Benchmark]: Toolchain (without parser) took 17867.73 ms. Allocated memory was 140.0 MB in the beginning and 412.1 MB in the end (delta: 272.1 MB). Free memory was 101.6 MB in the beginning and 130.6 MB in the end (delta: -29.1 MB). Peak memory consumption was 243.1 MB. Max. memory is 7.1 GB. [2020-09-24 21:45:59,729 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-24 21:45:59,731 INFO L168 Benchmark]: CACSL2BoogieTranslator took 834.69 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 100.9 MB in the beginning and 173.0 MB in the end (delta: -72.1 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-09-24 21:45:59,733 INFO L168 Benchmark]: Boogie Preprocessor took 132.09 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 168.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. [2020-09-24 21:45:59,735 INFO L168 Benchmark]: RCFGBuilder took 1623.00 ms. Allocated memory was 206.6 MB in the beginning and 239.1 MB in the end (delta: 32.5 MB). Free memory was 168.0 MB in the beginning and 166.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. [2020-09-24 21:45:59,744 INFO L168 Benchmark]: TraceAbstraction took 15267.75 ms. Allocated memory was 239.1 MB in the beginning and 412.1 MB in the end (delta: 173.0 MB). Free memory was 166.9 MB in the beginning and 130.6 MB in the end (delta: 36.3 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. [2020-09-24 21:45:59,756 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 834.69 ms. Allocated memory was 140.0 MB in the beginning and 206.6 MB in the end (delta: 66.6 MB). Free memory was 100.9 MB in the beginning and 173.0 MB in the end (delta: -72.1 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 132.09 ms. Allocated memory is still 206.6 MB. Free memory was 173.0 MB in the beginning and 168.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1623.00 ms. Allocated memory was 206.6 MB in the beginning and 239.1 MB in the end (delta: 32.5 MB). Free memory was 168.0 MB in the beginning and 166.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 83.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15267.75 ms. Allocated memory was 239.1 MB in the beginning and 412.1 MB in the end (delta: 173.0 MB). Free memory was 166.9 MB in the beginning and 130.6 MB in the end (delta: 36.3 MB). Peak memory consumption was 209.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 55]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L7] int inputC = 3; [L8] int inputD = 4; [L9] int inputE = 5; [L10] int inputF = 6; [L11] int inputB = 2; [L14] int a1 = 23; [L15] int a19 = 9; [L16] int a10 = 0; [L17] int a12 = 0; [L18] int a4 = 14; [L579] int output = -1; [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND TRUE ((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0))) [L211] a1 = (((a1 + -15535) - 211896) / 5) [L212] a10 = 2 [L214] return 22; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL, EXPR calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L57] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L60] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L63] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L66] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L69] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L72] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L75] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L78] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L81] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L84] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L87] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L90] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L93] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L96] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L99] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L102] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L105] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L108] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L111] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L114] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L117] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L120] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L123] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L126] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L129] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L132] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L135] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L138] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L141] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L144] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L147] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L150] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L153] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) [L156] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L159] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L162] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L165] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L168] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L171] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) [L174] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L177] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L180] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) [L183] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) [L186] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L189] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L192] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L195] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L198] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) [L201] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L205] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) [L210] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) [L215] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) [L220] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) [L225] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) [L231] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) [L236] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) [L239] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) [L244] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) [L249] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) [L254] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) [L260] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) [L265] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) [L271] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) [L277] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) [L283] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) [L286] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) [L291] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) [L296] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) [L301] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) [L306] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) [L312] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) [L317] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) [L320] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) [L323] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) [L326] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) [L329] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) [L335] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) [L340] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) [L345] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) [L351] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) [L354] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) [L357] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) [L360] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) [L365] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) [L370] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) [L375] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) [L378] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) [L383] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) [L388] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) [L393] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) [L398] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) [L403] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) [L408] COND TRUE ((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2)))) [L409] a1 = ((((a1 % 299890)+ 300108) * 1) * 1) [L410] a10 = 0 [L411] a19 = 8 [L413] return -1; [L590] RET, EXPR calculate_output(input) [L590] output = calculate_output(input) [L582] COND TRUE 1 [L585] int input; [L586] input = __VERIFIER_nondet_int() [L587] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L590] CALL calculate_output(input) [L21] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) [L24] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) [L27] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L30] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L33] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) [L36] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L39] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) [L42] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) [L45] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) [L48] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) [L51] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) [L54] COND TRUE (((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8)) [L55] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 456 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 612 SDtfs, 2538 SDslu, 830 SDs, 0 SdLazy, 3738 SolverSat, 487 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 120 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 513 NumberOfCodeBlocks, 513 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 219357 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 19/40 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...