./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label14.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label14.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 885db8f329f3cb77dfd41c47160cbfbb1b6e2c58b023e8af0fae7aece51927da --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:03:06,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:03:06,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:03:06,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:03:06,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:03:06,926 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:03:06,928 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:03:06,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:03:06,933 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:03:06,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:03:06,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:03:06,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:03:06,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:03:06,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:03:06,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:03:06,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:03:06,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:03:06,948 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:03:06,949 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:03:06,951 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:03:06,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:03:06,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:03:06,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:03:06,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:03:06,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:03:06,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:03:06,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:03:06,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:03:06,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:03:06,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:03:06,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:03:06,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:03:06,961 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:03:06,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:03:06,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:03:06,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:03:06,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:03:06,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:03:06,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:03:06,966 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:03:06,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:03:06,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:03:06,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:03:06,989 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:03:06,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:03:06,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:03:06,991 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:03:06,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:03:06,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:03:06,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:03:06,992 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:03:06,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:03:06,993 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:03:06,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:03:06,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:03:06,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:03:06,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:03:06,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:03:06,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:03:06,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:03:06,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:03:06,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:03:06,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:03:06,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:03:06,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:03:06,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:03:06,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:03:06,996 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:03:06,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:03:06,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:03:06,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:03:06,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:03:06,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:03:06,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:03:06,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:03:06,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 885db8f329f3cb77dfd41c47160cbfbb1b6e2c58b023e8af0fae7aece51927da [2022-02-20 16:03:07,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:03:07,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:03:07,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:03:07,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:03:07,241 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:03:07,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label14.c [2022-02-20 16:03:07,304 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085704301/fef3ed077ed54ce8a29941894ca1e03c/FLAG790d5f19c [2022-02-20 16:03:08,051 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:03:08,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label14.c [2022-02-20 16:03:08,104 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085704301/fef3ed077ed54ce8a29941894ca1e03c/FLAG790d5f19c [2022-02-20 16:03:08,322 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/085704301/fef3ed077ed54ce8a29941894ca1e03c [2022-02-20 16:03:08,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:03:08,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:03:08,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:03:08,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:03:08,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:03:08,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:03:08" (1/1) ... [2022-02-20 16:03:08,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75dc3da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:08, skipping insertion in model container [2022-02-20 16:03:08,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:03:08" (1/1) ... [2022-02-20 16:03:08,340 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:03:08,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:03:08,783 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label14.c[2035,2048] [2022-02-20 16:03:10,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:03:10,098 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:03:10,128 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label14.c[2035,2048] [2022-02-20 16:03:10,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:03:10,896 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:03:10,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10 WrapperNode [2022-02-20 16:03:10,897 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:03:10,898 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:03:10,898 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:03:10,898 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:03:10,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:11,010 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:11,946 INFO L137 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9425 [2022-02-20 16:03:11,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:03:11,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:03:11,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:03:11,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:03:11,955 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:11,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:03:12,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:03:12,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:03:12,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:03:12,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (1/1) ... [2022-02-20 16:03:12,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:03:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:03:12,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:03:13,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:03:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:03:13,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:03:13,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:03:13,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:03:13,113 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:03:13,115 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:03:29,259 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:03:29,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:03:29,277 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:03:29,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:03:29 BoogieIcfgContainer [2022-02-20 16:03:29,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:03:29,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:03:29,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:03:29,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:03:29,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:03:08" (1/3) ... [2022-02-20 16:03:29,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1582f8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:03:29, skipping insertion in model container [2022-02-20 16:03:29,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:03:10" (2/3) ... [2022-02-20 16:03:29,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1582f8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:03:29, skipping insertion in model container [2022-02-20 16:03:29,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:03:29" (3/3) ... [2022-02-20 16:03:29,289 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem19_label14.c [2022-02-20 16:03:29,294 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:03:29,294 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:03:29,343 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:03:29,349 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:03:29,349 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:03:29,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:03:29,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:03:29,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:03:29,407 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:03:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:03:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash -569068670, now seen corresponding path program 1 times [2022-02-20 16:03:29,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:03:29,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417727941] [2022-02-20 16:03:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:03:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:03:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:03:29,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {1751#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~inputA~0 := 1;~inputF~0 := 6;~inputC~0 := 3;~inputE~0 := 5;~inputD~0 := 4;~inputB~0 := 2;~a27~0 := -83;~a9~0 := 3;~a14~0 := -162;~a21~0 := -189;~a8~0 := 7; {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1753#(= 3 ~a9~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1753#(= 3 ~a9~0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~input~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {1753#(= 3 ~a9~0)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret11#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {1753#(= 3 ~a9~0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {1753#(= 3 ~a9~0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {1753#(= 3 ~a9~0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {1753#(= 3 ~a9~0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {1753#(= 3 ~a9~0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {1753#(= 3 ~a9~0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {1753#(= 3 ~a9~0)} is VALID [2022-02-20 16:03:29,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {1753#(= 3 ~a9~0)} assume (((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0; {1752#false} is VALID [2022-02-20 16:03:29,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {1752#false} assume !false; {1752#false} is VALID [2022-02-20 16:03:29,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:03:29,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:03:29,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417727941] [2022-02-20 16:03:29,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417727941] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:03:29,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:03:29,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:03:29,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316856660] [2022-02-20 16:03:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:03:29,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:03:29,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:03:29,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:29,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:03:29,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:03:29,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:03:29,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:03:29,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:03:29,716 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:03:43,345 INFO L93 Difference]: Finished difference Result 4975 states and 9416 transitions. [2022-02-20 16:03:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:03:43,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:03:43,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:03:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9416 transitions. [2022-02-20 16:03:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:43,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9416 transitions. [2022-02-20 16:03:43,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 9416 transitions. [2022-02-20 16:03:50,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9416 edges. 9416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:03:51,390 INFO L225 Difference]: With dead ends: 4975 [2022-02-20 16:03:51,390 INFO L226 Difference]: Without dead ends: 3163 [2022-02-20 16:03:51,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:03:51,400 INFO L933 BasicCegarLoop]: 1353 mSDtfsCounter, 1534 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 4670 mSolverCounterSat, 1123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 5793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1123 IncrementalHoareTripleChecker+Valid, 4670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-20 16:03:51,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1534 Valid, 1524 Invalid, 5793 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1123 Valid, 4670 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-02-20 16:03:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2022-02-20 16:03:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 3123. [2022-02-20 16:03:51,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:03:51,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3163 states. Second operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:51,570 INFO L74 IsIncluded]: Start isIncluded. First operand 3163 states. Second operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:51,580 INFO L87 Difference]: Start difference. First operand 3163 states. Second operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:52,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:03:52,027 INFO L93 Difference]: Finished difference Result 3163 states and 5159 transitions. [2022-02-20 16:03:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 5159 transitions. [2022-02-20 16:03:52,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:03:52,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:03:52,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3163 states. [2022-02-20 16:03:52,059 INFO L87 Difference]: Start difference. First operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3163 states. [2022-02-20 16:03:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:03:52,490 INFO L93 Difference]: Finished difference Result 3163 states and 5159 transitions. [2022-02-20 16:03:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3163 states and 5159 transitions. [2022-02-20 16:03:52,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:03:52,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:03:52,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:03:52,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:03:52,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3123 states, 3122 states have (on average 1.6268417680973735) internal successors, (5079), 3122 states have internal predecessors, (5079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:52,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3123 states to 3123 states and 5079 transitions. [2022-02-20 16:03:52,896 INFO L78 Accepts]: Start accepts. Automaton has 3123 states and 5079 transitions. Word has length 12 [2022-02-20 16:03:52,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:03:52,897 INFO L470 AbstractCegarLoop]: Abstraction has 3123 states and 5079 transitions. [2022-02-20 16:03:52,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 3123 states and 5079 transitions. [2022-02-20 16:03:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-20 16:03:52,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:03:52,899 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 16:03:52,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:03:52,900 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:03:52,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:03:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2081617299, now seen corresponding path program 1 times [2022-02-20 16:03:52,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:03:52,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287183555] [2022-02-20 16:03:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:03:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:03:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:03:53,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {16218#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~inputA~0 := 1;~inputF~0 := 6;~inputC~0 := 3;~inputE~0 := 5;~inputD~0 := 4;~inputB~0 := 2;~a27~0 := -83;~a9~0 := 3;~a14~0 := -162;~a21~0 := -189;~a8~0 := 7; {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~ret17#1, main_~input~0#1, main_~output~0#1;main_~output~0#1 := -1; {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~input~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret11#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,132 INFO L290 TraceCheckUtils]: 21: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,133 INFO L290 TraceCheckUtils]: 23: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 7 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,137 INFO L290 TraceCheckUtils]: 30: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,138 INFO L290 TraceCheckUtils]: 31: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 4 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,139 INFO L290 TraceCheckUtils]: 33: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,139 INFO L290 TraceCheckUtils]: 34: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,143 INFO L290 TraceCheckUtils]: 41: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,144 INFO L290 TraceCheckUtils]: 43: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 3 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,146 INFO L290 TraceCheckUtils]: 46: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,147 INFO L290 TraceCheckUtils]: 47: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,149 INFO L290 TraceCheckUtils]: 51: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,150 INFO L290 TraceCheckUtils]: 53: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,151 INFO L290 TraceCheckUtils]: 54: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,151 INFO L290 TraceCheckUtils]: 55: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 6 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,152 INFO L290 TraceCheckUtils]: 56: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,152 INFO L290 TraceCheckUtils]: 57: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 5 == ~a8~0) && 6 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,153 INFO L290 TraceCheckUtils]: 58: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,154 INFO L290 TraceCheckUtils]: 60: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,154 INFO L290 TraceCheckUtils]: 61: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,155 INFO L290 TraceCheckUtils]: 62: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,156 INFO L290 TraceCheckUtils]: 63: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,156 INFO L290 TraceCheckUtils]: 64: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !(((~a14~0 <= -148 && (2 == calculate_output_~input#1 && ~a21~0 <= -178) && 4 == ~a8~0) && 100 < ~a27~0 && 182 >= ~a27~0) && 3 == ~a9~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !(((-78 < ~a27~0 && 100 >= ~a27~0) && ((2 == calculate_output_~input#1 && ~a14~0 <= -148) && 2 == ~a9~0) && 4 == ~a8~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,158 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((-148 < ~a14~0 && 13 >= ~a14~0) && ~a21~0 <= -178 && 2 == ~a9~0 && (~a27~0 <= -78 && 6 == calculate_output_~input#1) && 7 == ~a8~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,159 INFO L290 TraceCheckUtils]: 68: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !(~a27~0 <= -78 && 4 == ~a8~0 && (-148 < ~a14~0 && 13 >= ~a14~0) && (((-178 < ~a21~0 && -144 >= ~a21~0) && 6 == ~a9~0) || (2 == ~a9~0 && -144 < ~a21~0 && 5 >= ~a21~0)) && 5 == calculate_output_~input#1); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,159 INFO L290 TraceCheckUtils]: 69: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !(5 < ~a21~0 && 6 == ~a8~0 && (-78 < ~a27~0 && 100 >= ~a27~0) && 6 == ~a9~0 && ~a14~0 <= -148 && 4 == calculate_output_~input#1); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume !((2 == ~a9~0 && ~a14~0 <= -148 && (100 < ~a27~0 && 182 >= ~a27~0) && 6 == calculate_output_~input#1 && ~a21~0 <= -178) && 7 == ~a8~0); {16220#(<= (+ ~a21~0 189) 0)} is VALID [2022-02-20 16:03:53,161 INFO L290 TraceCheckUtils]: 71: Hoare triple {16220#(<= (+ ~a21~0 189) 0)} assume (5 == ~a8~0 && 182 < ~a27~0 && (3 == ~a9~0 && 3 == calculate_output_~input#1) && ~a14~0 <= -148) && -178 < ~a21~0 && -144 >= ~a21~0;~a27~0 := 121 + (if (if ~a27~0 < 0 && 0 != ~a27~0 % 5 then 1 + ~a27~0 / 5 else ~a27~0 / 5) < 0 && 0 != (if ~a27~0 < 0 && 0 != ~a27~0 % 5 then 1 + ~a27~0 / 5 else ~a27~0 / 5) % 40 then (if ~a27~0 < 0 && 0 != ~a27~0 % 5 then 1 + ~a27~0 / 5 else ~a27~0 / 5) % 40 - 40 else (if ~a27~0 < 0 && 0 != ~a27~0 % 5 then 1 + ~a27~0 / 5 else ~a27~0 / 5) % 40) - -1;~a21~0 := 178914 + (if ~a21~0 - -24894 < 0 && 0 != (~a21~0 - -24894) % 5 then 1 + (~a21~0 - -24894) / 5 else (~a21~0 - -24894) / 5) - 414570;~a9~0 := 6;calculate_output_#res#1 := 25; {16219#false} is VALID [2022-02-20 16:03:53,161 INFO L290 TraceCheckUtils]: 72: Hoare triple {16219#false} main_#t~ret17#1 := calculate_output_#res#1;assume { :end_inline_calculate_output } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647;main_~output~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1; {16219#false} is VALID [2022-02-20 16:03:53,162 INFO L290 TraceCheckUtils]: 73: Hoare triple {16219#false} assume !false;havoc main_~input~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~input~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {16219#false} is VALID [2022-02-20 16:03:53,162 INFO L290 TraceCheckUtils]: 74: Hoare triple {16219#false} assume !(((((1 != main_~input~0#1 && 2 != main_~input~0#1) && 3 != main_~input~0#1) && 4 != main_~input~0#1) && 5 != main_~input~0#1) && 6 != main_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret11#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {16219#false} is VALID [2022-02-20 16:03:53,162 INFO L290 TraceCheckUtils]: 75: Hoare triple {16219#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 4 == ~a9~0) && ~a21~0 <= -178); {16219#false} is VALID [2022-02-20 16:03:53,162 INFO L290 TraceCheckUtils]: 76: Hoare triple {16219#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 3 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16219#false} is VALID [2022-02-20 16:03:53,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {16219#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && -178 < ~a21~0 && -144 >= ~a21~0); {16219#false} is VALID [2022-02-20 16:03:53,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {16219#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 5 == ~a9~0) && ~a21~0 <= -178); {16219#false} is VALID [2022-02-20 16:03:53,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {16219#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 5 == ~a9~0) && 5 < ~a21~0); {16219#false} is VALID [2022-02-20 16:03:53,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {16219#false} assume !((((~a14~0 <= -148 && ~a27~0 <= -78) && 6 == ~a8~0) && 6 == ~a9~0) && -144 < ~a21~0 && 5 >= ~a21~0); {16219#false} is VALID [2022-02-20 16:03:53,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {16219#false} assume (((~a14~0 <= -148 && ~a27~0 <= -78) && 4 == ~a8~0) && 2 == ~a9~0) && 5 < ~a21~0; {16219#false} is VALID [2022-02-20 16:03:53,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {16219#false} assume !false; {16219#false} is VALID [2022-02-20 16:03:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:03:53,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:03:53,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287183555] [2022-02-20 16:03:53,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287183555] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:03:53,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:03:53,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:03:53,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301231198] [2022-02-20 16:03:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:03:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-02-20 16:03:53,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:03:53,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:03:53,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:03:53,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:03:53,248 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:03:53,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:03:53,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:03:53,249 INFO L87 Difference]: Start difference. First operand 3123 states and 5079 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)