./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.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/locks/test_locks_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:22,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:22,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:22,916 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:22,918 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:22,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:22,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:22,925 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:22,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:22,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:22,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:22,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:22,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:22,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:22,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:22,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:22,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:22,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:22,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:22,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:22,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:22,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:22,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:22,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:22,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:22,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:22,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:22,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:22,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:22,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:22,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:22,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:22,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:22,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:22,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:22,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:22,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:22,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:22,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:22,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:22,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:22,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:39:22,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:22,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:22,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:22,994 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:22,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:22,995 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:22,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:22,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:22,995 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:22,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:22,996 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:22,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:22,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:22,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:22,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:22,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:22,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:22,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:22,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:22,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:22,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:22,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:22,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:22,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:22,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:22,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:22,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:22,999 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:22,999 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:22,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:22,999 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:23,000 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:23,000 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:23,000 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2022-02-20 14:39:23,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:23,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:23,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:23,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:23,301 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:23,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2022-02-20 14:39:23,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98d9828b/e144dab5b3204526bef949ba358944c4/FLAG818243f31 [2022-02-20 14:39:23,760 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:23,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2022-02-20 14:39:23,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98d9828b/e144dab5b3204526bef949ba358944c4/FLAG818243f31 [2022-02-20 14:39:24,157 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d98d9828b/e144dab5b3204526bef949ba358944c4 [2022-02-20 14:39:24,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:24,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:24,164 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:24,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:24,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:24,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ba184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24, skipping insertion in model container [2022-02-20 14:39:24,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:24,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:24,371 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/locks/test_locks_12.c[4591,4604] [2022-02-20 14:39:24,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:24,386 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:24,429 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/locks/test_locks_12.c[4591,4604] [2022-02-20 14:39:24,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:24,444 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:24,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24 WrapperNode [2022-02-20 14:39:24,444 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:24,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:24,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:24,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:24,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,499 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2022-02-20 14:39:24,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:24,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:24,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:24,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:24,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:24,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:24,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:24,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:24,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (1/1) ... [2022-02-20 14:39:24,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:24,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:24,576 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 14:39:24,589 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 14:39:24,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:24,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:24,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:24,681 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:24,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:25,039 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:25,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:25,057 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:25,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:25 BoogieIcfgContainer [2022-02-20 14:39:25,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:25,062 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:25,065 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:25,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:25,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:24" (1/3) ... [2022-02-20 14:39:25,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f020f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:25, skipping insertion in model container [2022-02-20 14:39:25,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:24" (2/3) ... [2022-02-20 14:39:25,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f020f91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:25, skipping insertion in model container [2022-02-20 14:39:25,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:25" (3/3) ... [2022-02-20 14:39:25,072 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-02-20 14:39:25,076 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:25,076 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:25,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:25,117 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 14:39:25,120 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 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 14:39:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:25,138 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:25,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:25,139 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:25,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:25,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2022-02-20 14:39:25,152 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:25,152 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765420318] [2022-02-20 14:39:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:25,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#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(16, 2);call #Ultimate.allocInit(12, 3); {49#true} is VALID [2022-02-20 14:39:25,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {49#true} is VALID [2022-02-20 14:39:25,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {49#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {49#true} is VALID [2022-02-20 14:39:25,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {49#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {49#true} is VALID [2022-02-20 14:39:25,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {49#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:25,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {51#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {50#false} is VALID [2022-02-20 14:39:25,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {50#false} assume !false; {50#false} is VALID [2022-02-20 14:39:25,359 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 14:39:25,360 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:25,361 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765420318] [2022-02-20 14:39:25,361 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765420318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:25,361 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:25,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:25,363 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111194153] [2022-02-20 14:39:25,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-02-20 14:39:25,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:25,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:25,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:25,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:25,394 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:25,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:25,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:25,413 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 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 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:25,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:25,618 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2022-02-20 14:39:25,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:25,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-02-20 14:39:25,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:25,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2022-02-20 14:39:25,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2022-02-20 14:39:25,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 169 transitions. [2022-02-20 14:39:25,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:25,821 INFO L225 Difference]: With dead ends: 95 [2022-02-20 14:39:25,821 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 14:39:25,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:25,836 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:25,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 14:39:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-02-20 14:39:25,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:25,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 14:39:25,865 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 14:39:25,867 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 14:39:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:25,876 INFO L93 Difference]: Finished difference Result 81 states and 149 transitions. [2022-02-20 14:39:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 149 transitions. [2022-02-20 14:39:25,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:25,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:25,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 81 states. [2022-02-20 14:39:25,879 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 81 states. [2022-02-20 14:39:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:25,889 INFO L93 Difference]: Finished difference Result 81 states and 149 transitions. [2022-02-20 14:39:25,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 149 transitions. [2022-02-20 14:39:25,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:25,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:25,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:25,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:25,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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 14:39:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2022-02-20 14:39:25,902 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2022-02-20 14:39:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:25,903 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2022-02-20 14:39:25,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2022-02-20 14:39:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:25,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:25,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:25,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:25,907 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:25,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2022-02-20 14:39:25,911 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:25,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336602514] [2022-02-20 14:39:25,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:25,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:26,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#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(16, 2);call #Ultimate.allocInit(12, 3); {379#true} is VALID [2022-02-20 14:39:26,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {379#true} is VALID [2022-02-20 14:39:26,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {379#true} is VALID [2022-02-20 14:39:26,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {379#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {379#true} is VALID [2022-02-20 14:39:26,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {379#true} assume !(0 != main_~p1~0#1); {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:26,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {381#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {380#false} is VALID [2022-02-20 14:39:26,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} assume 1 != main_~lk1~0#1; {380#false} is VALID [2022-02-20 14:39:26,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-02-20 14:39:26,021 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 14:39:26,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:26,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336602514] [2022-02-20 14:39:26,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336602514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:26,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:26,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:26,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476598850] [2022-02-20 14:39:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-02-20 14:39:26,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:26,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:26,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:26,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:26,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:26,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:26,042 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,170 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2022-02-20 14:39:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2022-02-20 14:39:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 14:39:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:26,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 14:39:26,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 224 transitions. [2022-02-20 14:39:26,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:26,380 INFO L225 Difference]: With dead ends: 134 [2022-02-20 14:39:26,380 INFO L226 Difference]: Without dead ends: 81 [2022-02-20 14:39:26,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:26,382 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:26,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:26,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-02-20 14:39:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-02-20 14:39:26,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:26,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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 14:39:26,389 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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 14:39:26,390 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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 14:39:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,393 INFO L93 Difference]: Finished difference Result 81 states and 147 transitions. [2022-02-20 14:39:26,393 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2022-02-20 14:39:26,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:26,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:26,394 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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 81 states. [2022-02-20 14:39:26,394 INFO L87 Difference]: Start difference. First operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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 81 states. [2022-02-20 14:39:26,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,397 INFO L93 Difference]: Finished difference Result 81 states and 147 transitions. [2022-02-20 14:39:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 147 transitions. [2022-02-20 14:39:26,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:26,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:26,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:26,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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 14:39:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2022-02-20 14:39:26,402 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2022-02-20 14:39:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:26,402 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2022-02-20 14:39:26,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 14:39:26,403 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2022-02-20 14:39:26,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:26,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:26,403 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:26,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:26,404 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:26,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2022-02-20 14:39:26,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:26,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876115807] [2022-02-20 14:39:26,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:26,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {768#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(16, 2);call #Ultimate.allocInit(12, 3); {768#true} is VALID [2022-02-20 14:39:26,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {768#true} is VALID [2022-02-20 14:39:26,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {768#true} is VALID [2022-02-20 14:39:26,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {768#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {768#true} is VALID [2022-02-20 14:39:26,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {768#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:26,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {770#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {769#false} is VALID [2022-02-20 14:39:26,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {769#false} assume 0 != main_~p2~0#1; {769#false} is VALID [2022-02-20 14:39:26,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {769#false} assume 1 != main_~lk2~0#1; {769#false} is VALID [2022-02-20 14:39:26,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-02-20 14:39:26,499 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 14:39:26,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:26,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876115807] [2022-02-20 14:39:26,500 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876115807] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:26,500 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:26,500 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:26,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313271278] [2022-02-20 14:39:26,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-02-20 14:39:26,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:26,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:26,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:26,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:26,517 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,616 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2022-02-20 14:39:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-02-20 14:39:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2022-02-20 14:39:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2022-02-20 14:39:26,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2022-02-20 14:39:26,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:26,780 INFO L225 Difference]: With dead ends: 123 [2022-02-20 14:39:26,781 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 14:39:26,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:26,782 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:26,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:26,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 14:39:26,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-02-20 14:39:26,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:26,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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 14:39:26,789 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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 14:39:26,789 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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 14:39:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,792 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-02-20 14:39:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 149 transitions. [2022-02-20 14:39:26,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:26,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:26,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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 84 states. [2022-02-20 14:39:26,793 INFO L87 Difference]: Start difference. First operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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 84 states. [2022-02-20 14:39:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,796 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-02-20 14:39:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 149 transitions. [2022-02-20 14:39:26,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:26,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:26,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:26,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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 14:39:26,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2022-02-20 14:39:26,800 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2022-02-20 14:39:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:26,801 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2022-02-20 14:39:26,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,801 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2022-02-20 14:39:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:26,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:26,802 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:26,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:26,802 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:26,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2022-02-20 14:39:26,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:26,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31914756] [2022-02-20 14:39:26,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:26,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:26,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {1157#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(16, 2);call #Ultimate.allocInit(12, 3); {1157#true} is VALID [2022-02-20 14:39:26,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {1157#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {1157#true} is VALID [2022-02-20 14:39:26,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {1157#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1157#true} is VALID [2022-02-20 14:39:26,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {1157#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {1157#true} is VALID [2022-02-20 14:39:26,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {1157#true} assume !(0 != main_~p1~0#1); {1157#true} is VALID [2022-02-20 14:39:26,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {1157#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:26,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {1159#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1158#false} is VALID [2022-02-20 14:39:26,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {1158#false} assume !false; {1158#false} is VALID [2022-02-20 14:39:26,850 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 14:39:26,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:26,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31914756] [2022-02-20 14:39:26,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31914756] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:26,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:26,851 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:26,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511548458] [2022-02-20 14:39:26,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:26,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-02-20 14:39:26,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:26,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:26,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:26,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:26,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:26,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:26,867 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,954 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2022-02-20 14:39:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-02-20 14:39:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:26,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:39:26,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:39:26,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 14:39:27,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,067 INFO L225 Difference]: With dead ends: 157 [2022-02-20 14:39:27,067 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 14:39:27,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:27,076 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:27,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:27,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 14:39:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-02-20 14:39:27,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:27,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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 14:39:27,087 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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 14:39:27,087 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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 14:39:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,091 INFO L93 Difference]: Finished difference Result 155 states and 282 transitions. [2022-02-20 14:39:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 282 transitions. [2022-02-20 14:39:27,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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 155 states. [2022-02-20 14:39:27,094 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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 155 states. [2022-02-20 14:39:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,099 INFO L93 Difference]: Finished difference Result 155 states and 282 transitions. [2022-02-20 14:39:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 282 transitions. [2022-02-20 14:39:27,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:27,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:27,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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 14:39:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2022-02-20 14:39:27,104 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2022-02-20 14:39:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:27,104 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2022-02-20 14:39:27,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2022-02-20 14:39:27,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:27,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:27,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:27,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:27,106 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:27,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2022-02-20 14:39:27,107 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:27,107 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361307011] [2022-02-20 14:39:27,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:27,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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(16, 2);call #Ultimate.allocInit(12, 3); {1750#true} is VALID [2022-02-20 14:39:27,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {1750#true} is VALID [2022-02-20 14:39:27,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {1750#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1750#true} is VALID [2022-02-20 14:39:27,145 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {1750#true} is VALID [2022-02-20 14:39:27,145 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#true} assume !(0 != main_~p1~0#1); {1750#true} is VALID [2022-02-20 14:39:27,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {1750#true} assume !(0 != main_~p2~0#1); {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:27,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {1752#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1751#false} is VALID [2022-02-20 14:39:27,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {1751#false} assume 1 != main_~lk2~0#1; {1751#false} is VALID [2022-02-20 14:39:27,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 14:39:27,152 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 14:39:27,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:27,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361307011] [2022-02-20 14:39:27,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361307011] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:27,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:27,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:27,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250644828] [2022-02-20 14:39:27,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:27,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-02-20 14:39:27,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:27,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:27,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:27,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:27,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:27,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:27,168 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,259 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2022-02-20 14:39:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-02-20 14:39:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2022-02-20 14:39:27,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:27,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2022-02-20 14:39:27,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2022-02-20 14:39:27,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,431 INFO L225 Difference]: With dead ends: 261 [2022-02-20 14:39:27,431 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 14:39:27,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:27,433 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:27,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 14:39:27,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2022-02-20 14:39:27,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:27,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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 14:39:27,440 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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 14:39:27,440 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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 14:39:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,444 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2022-02-20 14:39:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 280 transitions. [2022-02-20 14:39:27,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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 157 states. [2022-02-20 14:39:27,446 INFO L87 Difference]: Start difference. First operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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 157 states. [2022-02-20 14:39:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,450 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2022-02-20 14:39:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 280 transitions. [2022-02-20 14:39:27,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:27,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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 14:39:27,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2022-02-20 14:39:27,455 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2022-02-20 14:39:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:27,456 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2022-02-20 14:39:27,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 14:39:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2022-02-20 14:39:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:27,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:27,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:27,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:27,457 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:27,458 INFO L85 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2022-02-20 14:39:27,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:27,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396664257] [2022-02-20 14:39:27,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:27,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {2501#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(16, 2);call #Ultimate.allocInit(12, 3); {2501#true} is VALID [2022-02-20 14:39:27,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {2501#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {2501#true} is VALID [2022-02-20 14:39:27,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {2501#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {2501#true} is VALID [2022-02-20 14:39:27,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {2501#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {2501#true} is VALID [2022-02-20 14:39:27,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {2501#true} assume !(0 != main_~p1~0#1); {2501#true} is VALID [2022-02-20 14:39:27,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {2501#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:27,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {2503#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2502#false} is VALID [2022-02-20 14:39:27,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {2502#false} assume 0 != main_~p3~0#1; {2502#false} is VALID [2022-02-20 14:39:27,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {2502#false} assume 1 != main_~lk3~0#1; {2502#false} is VALID [2022-02-20 14:39:27,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2022-02-20 14:39:27,504 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 14:39:27,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:27,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396664257] [2022-02-20 14:39:27,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396664257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:27,504 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:27,504 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:27,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642615692] [2022-02-20 14:39:27,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:27,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:27,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:27,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:27,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:27,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:27,522 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,622 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2022-02-20 14:39:27,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:27,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:27,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:27,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-02-20 14:39:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-02-20 14:39:27,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2022-02-20 14:39:27,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,799 INFO L225 Difference]: With dead ends: 234 [2022-02-20 14:39:27,799 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 14:39:27,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:27,803 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:27,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 14:39:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-02-20 14:39:27,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:27,819 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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 14:39:27,819 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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 14:39:27,820 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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 14:39:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,836 INFO L93 Difference]: Finished difference Result 159 states and 280 transitions. [2022-02-20 14:39:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 280 transitions. [2022-02-20 14:39:27,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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 159 states. [2022-02-20 14:39:27,838 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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 159 states. [2022-02-20 14:39:27,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,842 INFO L93 Difference]: Finished difference Result 159 states and 280 transitions. [2022-02-20 14:39:27,842 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 280 transitions. [2022-02-20 14:39:27,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:27,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:27,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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 14:39:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2022-02-20 14:39:27,846 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2022-02-20 14:39:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:27,847 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2022-02-20 14:39:27,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2022-02-20 14:39:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:27,848 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:27,848 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:27,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:27,849 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:27,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:27,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2022-02-20 14:39:27,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:27,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236908091] [2022-02-20 14:39:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:27,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:27,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {3231#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(16, 2);call #Ultimate.allocInit(12, 3); {3231#true} is VALID [2022-02-20 14:39:27,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {3231#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {3231#true} is VALID [2022-02-20 14:39:27,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {3231#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {3231#true} is VALID [2022-02-20 14:39:27,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {3231#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {3231#true} is VALID [2022-02-20 14:39:27,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {3231#true} assume !(0 != main_~p1~0#1); {3231#true} is VALID [2022-02-20 14:39:27,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {3231#true} assume !(0 != main_~p2~0#1); {3231#true} is VALID [2022-02-20 14:39:27,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {3231#true} assume !(0 != main_~p3~0#1); {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,924 INFO L290 TraceCheckUtils]: 13: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:27,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {3233#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {3232#false} is VALID [2022-02-20 14:39:27,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3232#false} assume 1 != main_~lk3~0#1; {3232#false} is VALID [2022-02-20 14:39:27,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3232#false} assume !false; {3232#false} is VALID [2022-02-20 14:39:27,933 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 14:39:27,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:27,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236908091] [2022-02-20 14:39:27,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236908091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:27,933 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:27,933 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:27,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746386154] [2022-02-20 14:39:27,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:27,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:27,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:27,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:27,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:27,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:27,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:27,951 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,038 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2022-02-20 14:39:28,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:28,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:28,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:28,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2022-02-20 14:39:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2022-02-20 14:39:28,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 219 transitions. [2022-02-20 14:39:28,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:28,202 INFO L225 Difference]: With dead ends: 453 [2022-02-20 14:39:28,204 INFO L226 Difference]: Without dead ends: 303 [2022-02-20 14:39:28,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:28,207 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:28,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:28,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-02-20 14:39:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2022-02-20 14:39:28,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:28,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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 14:39:28,221 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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 14:39:28,222 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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 14:39:28,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,229 INFO L93 Difference]: Finished difference Result 303 states and 532 transitions. [2022-02-20 14:39:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 532 transitions. [2022-02-20 14:39:28,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:28,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:28,231 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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 303 states. [2022-02-20 14:39:28,231 INFO L87 Difference]: Start difference. First operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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 303 states. [2022-02-20 14:39:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,239 INFO L93 Difference]: Finished difference Result 303 states and 532 transitions. [2022-02-20 14:39:28,239 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 532 transitions. [2022-02-20 14:39:28,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:28,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:28,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:28,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 states have internal predecessors, (531), 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 14:39:28,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2022-02-20 14:39:28,247 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2022-02-20 14:39:28,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:28,248 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2022-02-20 14:39:28,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2022-02-20 14:39:28,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:28,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:28,250 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:28,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:28,251 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:28,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2022-02-20 14:39:28,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:28,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303855517] [2022-02-20 14:39:28,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:28,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:28,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {4622#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(16, 2);call #Ultimate.allocInit(12, 3); {4622#true} is VALID [2022-02-20 14:39:28,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {4622#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {4622#true} is VALID [2022-02-20 14:39:28,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {4622#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {4622#true} is VALID [2022-02-20 14:39:28,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {4622#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {4622#true} is VALID [2022-02-20 14:39:28,307 INFO L290 TraceCheckUtils]: 4: Hoare triple {4622#true} assume !(0 != main_~p1~0#1); {4622#true} is VALID [2022-02-20 14:39:28,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {4622#true} assume !(0 != main_~p2~0#1); {4622#true} is VALID [2022-02-20 14:39:28,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {4622#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:28,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {4624#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {4623#false} is VALID [2022-02-20 14:39:28,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {4623#false} assume !false; {4623#false} is VALID [2022-02-20 14:39:28,313 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 14:39:28,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:28,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303855517] [2022-02-20 14:39:28,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303855517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:28,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:28,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:28,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440223345] [2022-02-20 14:39:28,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:28,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:28,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:28,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:28,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:28,329 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:28,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:28,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:28,330 INFO L87 Difference]: Start difference. First operand 301 states and 531 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,433 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2022-02-20 14:39:28,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:28,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:28,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 14:39:28,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-20 14:39:28,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-20 14:39:28,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:28,547 INFO L225 Difference]: With dead ends: 385 [2022-02-20 14:39:28,547 INFO L226 Difference]: Without dead ends: 383 [2022-02-20 14:39:28,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:28,548 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:28,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-02-20 14:39:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2022-02-20 14:39:28,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:28,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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 14:39:28,562 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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 14:39:28,563 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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 14:39:28,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,573 INFO L93 Difference]: Finished difference Result 383 states and 680 transitions. [2022-02-20 14:39:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 680 transitions. [2022-02-20 14:39:28,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:28,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:28,574 INFO L74 IsIncluded]: Start isIncluded. First operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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 383 states. [2022-02-20 14:39:28,575 INFO L87 Difference]: Start difference. First operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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 383 states. [2022-02-20 14:39:28,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,584 INFO L93 Difference]: Finished difference Result 383 states and 680 transitions. [2022-02-20 14:39:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 680 transitions. [2022-02-20 14:39:28,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:28,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:28,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:28,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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 14:39:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2022-02-20 14:39:28,592 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2022-02-20 14:39:28,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:28,592 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2022-02-20 14:39:28,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 14:39:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2022-02-20 14:39:28,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:28,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:28,593 INFO L514 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] [2022-02-20 14:39:28,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:28,593 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2022-02-20 14:39:28,594 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:28,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982002433] [2022-02-20 14:39:28,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:28,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {6105#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(16, 2);call #Ultimate.allocInit(12, 3); {6105#true} is VALID [2022-02-20 14:39:28,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {6105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {6105#true} is VALID [2022-02-20 14:39:28,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {6105#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {6105#true} is VALID [2022-02-20 14:39:28,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {6105#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {6105#true} is VALID [2022-02-20 14:39:28,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {6105#true} assume !(0 != main_~p1~0#1); {6105#true} is VALID [2022-02-20 14:39:28,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {6105#true} assume !(0 != main_~p2~0#1); {6105#true} is VALID [2022-02-20 14:39:28,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {6105#true} assume !(0 != main_~p3~0#1); {6105#true} is VALID [2022-02-20 14:39:28,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {6105#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:28,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {6107#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {6106#false} is VALID [2022-02-20 14:39:28,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {6106#false} assume !false; {6106#false} is VALID [2022-02-20 14:39:28,637 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 14:39:28,637 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:28,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982002433] [2022-02-20 14:39:28,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982002433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:28,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:28,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:28,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976930932] [2022-02-20 14:39:28,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:28,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 14:39:28,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:28,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:28,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:28,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:28,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:28,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:28,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:28,655 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:28,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,756 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2022-02-20 14:39:28,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 14:39:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:28,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2022-02-20 14:39:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:28,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2022-02-20 14:39:28,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 139 transitions. [2022-02-20 14:39:28,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:28,874 INFO L225 Difference]: With dead ends: 565 [2022-02-20 14:39:28,874 INFO L226 Difference]: Without dead ends: 563 [2022-02-20 14:39:28,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:28,875 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:28,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-02-20 14:39:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2022-02-20 14:39:28,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:28,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 563 states. Second operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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 14:39:28,885 INFO L74 IsIncluded]: Start isIncluded. First operand 563 states. Second operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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 14:39:28,885 INFO L87 Difference]: Start difference. First operand 563 states. Second operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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 14:39:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,902 INFO L93 Difference]: Finished difference Result 563 states and 992 transitions. [2022-02-20 14:39:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 992 transitions. [2022-02-20 14:39:28,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:28,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:28,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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 563 states. [2022-02-20 14:39:28,905 INFO L87 Difference]: Start difference. First operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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 563 states. [2022-02-20 14:39:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,922 INFO L93 Difference]: Finished difference Result 563 states and 992 transitions. [2022-02-20 14:39:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 992 transitions. [2022-02-20 14:39:28,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:28,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:28,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:28,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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 14:39:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2022-02-20 14:39:28,935 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2022-02-20 14:39:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:28,935 INFO L470 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2022-02-20 14:39:28,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2022-02-20 14:39:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:28,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:28,937 INFO L514 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] [2022-02-20 14:39:28,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:28,937 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2022-02-20 14:39:28,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:28,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700178155] [2022-02-20 14:39:28,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:28,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:28,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {8248#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(16, 2);call #Ultimate.allocInit(12, 3); {8248#true} is VALID [2022-02-20 14:39:28,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {8248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {8248#true} is VALID [2022-02-20 14:39:28,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {8248#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {8248#true} is VALID [2022-02-20 14:39:28,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {8248#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {8248#true} is VALID [2022-02-20 14:39:28,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {8248#true} assume !(0 != main_~p1~0#1); {8248#true} is VALID [2022-02-20 14:39:28,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {8248#true} assume !(0 != main_~p2~0#1); {8248#true} is VALID [2022-02-20 14:39:28,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {8248#true} assume !(0 != main_~p3~0#1); {8248#true} is VALID [2022-02-20 14:39:28,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {8248#true} assume !(0 != main_~p4~0#1); {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:28,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {8250#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {8249#false} is VALID [2022-02-20 14:39:28,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {8249#false} assume 1 != main_~lk4~0#1; {8249#false} is VALID [2022-02-20 14:39:28,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {8249#false} assume !false; {8249#false} is VALID [2022-02-20 14:39:28,971 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 14:39:28,971 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:28,971 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700178155] [2022-02-20 14:39:28,972 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700178155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:28,972 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:28,972 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:28,972 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603268090] [2022-02-20 14:39:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:28,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 14:39:28,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:28,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:28,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:28,987 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:28,987 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:28,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:28,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:28,988 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:29,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,123 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2022-02-20 14:39:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:29,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-02-20 14:39:29,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2022-02-20 14:39:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2022-02-20 14:39:29,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 215 transitions. [2022-02-20 14:39:29,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:29,281 INFO L225 Difference]: With dead ends: 997 [2022-02-20 14:39:29,282 INFO L226 Difference]: Without dead ends: 587 [2022-02-20 14:39:29,282 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:29,283 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:29,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-02-20 14:39:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-02-20 14:39:29,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:29,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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 14:39:29,295 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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 14:39:29,296 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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 14:39:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,314 INFO L93 Difference]: Finished difference Result 587 states and 1004 transitions. [2022-02-20 14:39:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1004 transitions. [2022-02-20 14:39:29,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:29,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:29,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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 587 states. [2022-02-20 14:39:29,317 INFO L87 Difference]: Start difference. First operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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 587 states. [2022-02-20 14:39:29,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,334 INFO L93 Difference]: Finished difference Result 587 states and 1004 transitions. [2022-02-20 14:39:29,335 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 1004 transitions. [2022-02-20 14:39:29,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:29,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:29,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:29,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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 14:39:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2022-02-20 14:39:29,354 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2022-02-20 14:39:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:29,355 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2022-02-20 14:39:29,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 14:39:29,355 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2022-02-20 14:39:29,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:29,356 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:29,356 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:29,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:29,356 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:29,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:29,357 INFO L85 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2022-02-20 14:39:29,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:29,357 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835055699] [2022-02-20 14:39:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:29,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:29,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {11055#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(16, 2);call #Ultimate.allocInit(12, 3); {11055#true} is VALID [2022-02-20 14:39:29,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {11055#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {11055#true} is VALID [2022-02-20 14:39:29,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {11055#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {11055#true} is VALID [2022-02-20 14:39:29,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {11055#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {11055#true} is VALID [2022-02-20 14:39:29,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {11055#true} assume !(0 != main_~p1~0#1); {11055#true} is VALID [2022-02-20 14:39:29,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {11055#true} assume !(0 != main_~p2~0#1); {11055#true} is VALID [2022-02-20 14:39:29,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {11055#true} assume !(0 != main_~p3~0#1); {11055#true} is VALID [2022-02-20 14:39:29,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {11055#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:29,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {11056#false} is VALID [2022-02-20 14:39:29,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {11056#false} assume 0 != main_~p5~0#1; {11056#false} is VALID [2022-02-20 14:39:29,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {11056#false} assume 1 != main_~lk5~0#1; {11056#false} is VALID [2022-02-20 14:39:29,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {11056#false} assume !false; {11056#false} is VALID [2022-02-20 14:39:29,392 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 14:39:29,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:29,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835055699] [2022-02-20 14:39:29,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835055699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:29,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:29,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:29,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853173366] [2022-02-20 14:39:29,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:29,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-02-20 14:39:29,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:29,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:29,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:29,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:29,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:29,409 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,531 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2022-02-20 14:39:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:29,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-02-20 14:39:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:29,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2022-02-20 14:39:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2022-02-20 14:39:29,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 210 transitions. [2022-02-20 14:39:29,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:29,693 INFO L225 Difference]: With dead ends: 885 [2022-02-20 14:39:29,693 INFO L226 Difference]: Without dead ends: 599 [2022-02-20 14:39:29,693 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:29,694 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:29,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-20 14:39:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-02-20 14:39:29,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:29,707 INFO L82 GeneralOperation]: Start isEquivalent. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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 14:39:29,708 INFO L74 IsIncluded]: Start isIncluded. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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 14:39:29,709 INFO L87 Difference]: Start difference. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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 14:39:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,728 INFO L93 Difference]: Finished difference Result 599 states and 1012 transitions. [2022-02-20 14:39:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1012 transitions. [2022-02-20 14:39:29,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:29,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:29,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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 599 states. [2022-02-20 14:39:29,731 INFO L87 Difference]: Start difference. First operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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 599 states. [2022-02-20 14:39:29,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,750 INFO L93 Difference]: Finished difference Result 599 states and 1012 transitions. [2022-02-20 14:39:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1012 transitions. [2022-02-20 14:39:29,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:29,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:29,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:29,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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 14:39:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2022-02-20 14:39:29,770 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2022-02-20 14:39:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:29,770 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2022-02-20 14:39:29,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2022-02-20 14:39:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:29,771 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:29,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:29,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:29,772 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:29,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2022-02-20 14:39:29,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:29,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679770281] [2022-02-20 14:39:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:29,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {13786#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(16, 2);call #Ultimate.allocInit(12, 3); {13786#true} is VALID [2022-02-20 14:39:29,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {13786#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {13786#true} is VALID [2022-02-20 14:39:29,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {13786#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {13786#true} is VALID [2022-02-20 14:39:29,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {13786#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {13786#true} is VALID [2022-02-20 14:39:29,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {13786#true} assume !(0 != main_~p1~0#1); {13786#true} is VALID [2022-02-20 14:39:29,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {13786#true} assume !(0 != main_~p2~0#1); {13786#true} is VALID [2022-02-20 14:39:29,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {13786#true} assume !(0 != main_~p3~0#1); {13786#true} is VALID [2022-02-20 14:39:29,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {13786#true} assume !(0 != main_~p4~0#1); {13786#true} is VALID [2022-02-20 14:39:29,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {13786#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:29,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {13788#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {13787#false} is VALID [2022-02-20 14:39:29,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {13787#false} assume !false; {13787#false} is VALID [2022-02-20 14:39:29,804 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 14:39:29,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:29,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679770281] [2022-02-20 14:39:29,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679770281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:29,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:29,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:29,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311721312] [2022-02-20 14:39:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:29,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-02-20 14:39:29,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:29,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:29,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:29,822 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:29,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:29,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:29,823 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,947 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2022-02-20 14:39:29,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:29,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-02-20 14:39:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 14:39:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 14:39:29,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2022-02-20 14:39:30,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:30,100 INFO L225 Difference]: With dead ends: 1097 [2022-02-20 14:39:30,100 INFO L226 Difference]: Without dead ends: 1095 [2022-02-20 14:39:30,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:30,102 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:30,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:30,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-02-20 14:39:30,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2022-02-20 14:39:30,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:30,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1095 states. Second operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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 14:39:30,128 INFO L74 IsIncluded]: Start isIncluded. First operand 1095 states. Second operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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 14:39:30,142 INFO L87 Difference]: Start difference. First operand 1095 states. Second operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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 14:39:30,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:30,196 INFO L93 Difference]: Finished difference Result 1095 states and 1868 transitions. [2022-02-20 14:39:30,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1868 transitions. [2022-02-20 14:39:30,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:30,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:30,200 INFO L74 IsIncluded]: Start isIncluded. First operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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 1095 states. [2022-02-20 14:39:30,201 INFO L87 Difference]: Start difference. First operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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 1095 states. [2022-02-20 14:39:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:30,254 INFO L93 Difference]: Finished difference Result 1095 states and 1868 transitions. [2022-02-20 14:39:30,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1868 transitions. [2022-02-20 14:39:30,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:30,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:30,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:30,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:30,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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 14:39:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2022-02-20 14:39:30,293 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2022-02-20 14:39:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:30,293 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2022-02-20 14:39:30,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2022-02-20 14:39:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:30,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:30,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:30,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:30,296 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:30,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2022-02-20 14:39:30,297 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:30,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542334282] [2022-02-20 14:39:30,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:30,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:30,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {17969#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(16, 2);call #Ultimate.allocInit(12, 3); {17969#true} is VALID [2022-02-20 14:39:30,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {17969#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {17969#true} is VALID [2022-02-20 14:39:30,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {17969#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {17969#true} is VALID [2022-02-20 14:39:30,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {17969#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {17969#true} is VALID [2022-02-20 14:39:30,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {17969#true} assume !(0 != main_~p1~0#1); {17969#true} is VALID [2022-02-20 14:39:30,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {17969#true} assume !(0 != main_~p2~0#1); {17969#true} is VALID [2022-02-20 14:39:30,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {17969#true} assume !(0 != main_~p3~0#1); {17969#true} is VALID [2022-02-20 14:39:30,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {17969#true} assume !(0 != main_~p4~0#1); {17969#true} is VALID [2022-02-20 14:39:30,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {17969#true} assume !(0 != main_~p5~0#1); {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:30,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {17971#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {17970#false} is VALID [2022-02-20 14:39:30,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {17970#false} assume 1 != main_~lk5~0#1; {17970#false} is VALID [2022-02-20 14:39:30,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {17970#false} assume !false; {17970#false} is VALID [2022-02-20 14:39:30,355 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 14:39:30,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:30,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542334282] [2022-02-20 14:39:30,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542334282] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:30,355 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:30,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:30,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579105949] [2022-02-20 14:39:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-02-20 14:39:30,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:30,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:30,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:30,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:30,373 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:30,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:30,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:30,374 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:30,619 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2022-02-20 14:39:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:30,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-02-20 14:39:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-02-20 14:39:30,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2022-02-20 14:39:30,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 212 transitions. [2022-02-20 14:39:30,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:30,840 INFO L225 Difference]: With dead ends: 1977 [2022-02-20 14:39:30,840 INFO L226 Difference]: Without dead ends: 1159 [2022-02-20 14:39:30,842 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:30,842 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:30,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-02-20 14:39:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2022-02-20 14:39:30,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:30,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1159 states. Second operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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 14:39:30,867 INFO L74 IsIncluded]: Start isIncluded. First operand 1159 states. Second operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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 14:39:30,868 INFO L87 Difference]: Start difference. First operand 1159 states. Second operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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 14:39:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:30,942 INFO L93 Difference]: Finished difference Result 1159 states and 1908 transitions. [2022-02-20 14:39:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1908 transitions. [2022-02-20 14:39:30,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:30,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:30,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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 1159 states. [2022-02-20 14:39:30,948 INFO L87 Difference]: Start difference. First operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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 1159 states. [2022-02-20 14:39:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:31,008 INFO L93 Difference]: Finished difference Result 1159 states and 1908 transitions. [2022-02-20 14:39:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1908 transitions. [2022-02-20 14:39:31,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:31,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:31,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:31,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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 14:39:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2022-02-20 14:39:31,075 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2022-02-20 14:39:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:31,075 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2022-02-20 14:39:31,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 14:39:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2022-02-20 14:39:31,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:31,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:31,077 INFO L514 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] [2022-02-20 14:39:31,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:31,077 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:31,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2022-02-20 14:39:31,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:31,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222389752] [2022-02-20 14:39:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:31,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {23512#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(16, 2);call #Ultimate.allocInit(12, 3); {23512#true} is VALID [2022-02-20 14:39:31,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {23512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {23512#true} is VALID [2022-02-20 14:39:31,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {23512#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {23512#true} is VALID [2022-02-20 14:39:31,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {23512#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {23512#true} is VALID [2022-02-20 14:39:31,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {23512#true} assume !(0 != main_~p1~0#1); {23512#true} is VALID [2022-02-20 14:39:31,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {23512#true} assume !(0 != main_~p2~0#1); {23512#true} is VALID [2022-02-20 14:39:31,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {23512#true} assume !(0 != main_~p3~0#1); {23512#true} is VALID [2022-02-20 14:39:31,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {23512#true} assume !(0 != main_~p4~0#1); {23512#true} is VALID [2022-02-20 14:39:31,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {23512#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:31,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {23514#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {23513#false} is VALID [2022-02-20 14:39:31,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {23513#false} assume 0 != main_~p6~0#1; {23513#false} is VALID [2022-02-20 14:39:31,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {23513#false} assume 1 != main_~lk6~0#1; {23513#false} is VALID [2022-02-20 14:39:31,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {23513#false} assume !false; {23513#false} is VALID [2022-02-20 14:39:31,113 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 14:39:31,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:31,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222389752] [2022-02-20 14:39:31,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222389752] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:31,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:31,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:31,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891645024] [2022-02-20 14:39:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:31,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-20 14:39:31,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:31,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:31,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:31,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:31,131 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:31,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:31,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:31,132 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:31,361 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2022-02-20 14:39:31,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:31,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-20 14:39:31,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:31,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2022-02-20 14:39:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2022-02-20 14:39:31,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 207 transitions. [2022-02-20 14:39:31,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:31,566 INFO L225 Difference]: With dead ends: 1737 [2022-02-20 14:39:31,566 INFO L226 Difference]: Without dead ends: 1175 [2022-02-20 14:39:31,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:31,568 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:31,568 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-02-20 14:39:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2022-02-20 14:39:31,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:31,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1175 states. Second operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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 14:39:31,592 INFO L74 IsIncluded]: Start isIncluded. First operand 1175 states. Second operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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 14:39:31,594 INFO L87 Difference]: Start difference. First operand 1175 states. Second operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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 14:39:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:31,658 INFO L93 Difference]: Finished difference Result 1175 states and 1908 transitions. [2022-02-20 14:39:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1908 transitions. [2022-02-20 14:39:31,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:31,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:31,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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 1175 states. [2022-02-20 14:39:31,663 INFO L87 Difference]: Start difference. First operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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 1175 states. [2022-02-20 14:39:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:31,720 INFO L93 Difference]: Finished difference Result 1175 states and 1908 transitions. [2022-02-20 14:39:31,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1908 transitions. [2022-02-20 14:39:31,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:31,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:31,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:31,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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 14:39:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2022-02-20 14:39:31,782 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2022-02-20 14:39:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:31,783 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2022-02-20 14:39:31,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:31,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2022-02-20 14:39:31,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:31,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:31,784 INFO L514 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] [2022-02-20 14:39:31,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:39:31,785 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:31,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2022-02-20 14:39:31,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:31,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199642360] [2022-02-20 14:39:31,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:31,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {28863#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(16, 2);call #Ultimate.allocInit(12, 3); {28863#true} is VALID [2022-02-20 14:39:31,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {28863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {28863#true} is VALID [2022-02-20 14:39:31,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {28863#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {28863#true} is VALID [2022-02-20 14:39:31,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {28863#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {28863#true} is VALID [2022-02-20 14:39:31,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {28863#true} assume !(0 != main_~p1~0#1); {28863#true} is VALID [2022-02-20 14:39:31,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {28863#true} assume !(0 != main_~p2~0#1); {28863#true} is VALID [2022-02-20 14:39:31,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {28863#true} assume !(0 != main_~p3~0#1); {28863#true} is VALID [2022-02-20 14:39:31,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {28863#true} assume !(0 != main_~p4~0#1); {28863#true} is VALID [2022-02-20 14:39:31,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {28863#true} assume !(0 != main_~p5~0#1); {28863#true} is VALID [2022-02-20 14:39:31,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {28863#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:31,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {28865#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {28864#false} is VALID [2022-02-20 14:39:31,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {28864#false} assume !false; {28864#false} is VALID [2022-02-20 14:39:31,829 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 14:39:31,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:31,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199642360] [2022-02-20 14:39:31,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199642360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:31,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:31,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:31,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162068474] [2022-02-20 14:39:31,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-20 14:39:31,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:31,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:31,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:31,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:31,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:31,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:31,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:31,848 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:32,086 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2022-02-20 14:39:32,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:32,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-20 14:39:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 14:39:32,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:32,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 14:39:32,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2022-02-20 14:39:32,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:32,345 INFO L225 Difference]: With dead ends: 2121 [2022-02-20 14:39:32,345 INFO L226 Difference]: Without dead ends: 2119 [2022-02-20 14:39:32,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:32,347 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:32,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-02-20 14:39:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2022-02-20 14:39:32,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:32,381 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2119 states. Second operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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 14:39:32,383 INFO L74 IsIncluded]: Start isIncluded. First operand 2119 states. Second operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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 14:39:32,384 INFO L87 Difference]: Start difference. First operand 2119 states. Second operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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 14:39:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:32,521 INFO L93 Difference]: Finished difference Result 2119 states and 3476 transitions. [2022-02-20 14:39:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3476 transitions. [2022-02-20 14:39:32,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:32,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:32,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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 2119 states. [2022-02-20 14:39:32,527 INFO L87 Difference]: Start difference. First operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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 2119 states. [2022-02-20 14:39:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:32,713 INFO L93 Difference]: Finished difference Result 2119 states and 3476 transitions. [2022-02-20 14:39:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3476 transitions. [2022-02-20 14:39:32,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:32,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:32,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:32,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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 14:39:32,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2022-02-20 14:39:32,823 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2022-02-20 14:39:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:32,823 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2022-02-20 14:39:32,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2022-02-20 14:39:32,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:32,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:32,825 INFO L514 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] [2022-02-20 14:39:32,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:39:32,825 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:32,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2022-02-20 14:39:32,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:32,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526518970] [2022-02-20 14:39:32,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:32,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {36998#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(16, 2);call #Ultimate.allocInit(12, 3); {36998#true} is VALID [2022-02-20 14:39:32,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {36998#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {36998#true} is VALID [2022-02-20 14:39:32,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {36998#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {36998#true} is VALID [2022-02-20 14:39:32,851 INFO L290 TraceCheckUtils]: 3: Hoare triple {36998#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {36998#true} is VALID [2022-02-20 14:39:32,851 INFO L290 TraceCheckUtils]: 4: Hoare triple {36998#true} assume !(0 != main_~p1~0#1); {36998#true} is VALID [2022-02-20 14:39:32,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {36998#true} assume !(0 != main_~p2~0#1); {36998#true} is VALID [2022-02-20 14:39:32,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {36998#true} assume !(0 != main_~p3~0#1); {36998#true} is VALID [2022-02-20 14:39:32,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {36998#true} assume !(0 != main_~p4~0#1); {36998#true} is VALID [2022-02-20 14:39:32,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {36998#true} assume !(0 != main_~p5~0#1); {36998#true} is VALID [2022-02-20 14:39:32,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {36998#true} assume !(0 != main_~p6~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:32,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {37000#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {36999#false} is VALID [2022-02-20 14:39:32,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {36999#false} assume 1 != main_~lk6~0#1; {36999#false} is VALID [2022-02-20 14:39:32,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {36999#false} assume !false; {36999#false} is VALID [2022-02-20 14:39:32,857 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 14:39:32,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:32,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526518970] [2022-02-20 14:39:32,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526518970] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:32,857 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:32,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:32,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373208966] [2022-02-20 14:39:32,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:32,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-20 14:39:32,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:32,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:32,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:32,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:32,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:32,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:32,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:32,875 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:33,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:33,635 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2022-02-20 14:39:33,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:33,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-02-20 14:39:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2022-02-20 14:39:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:33,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2022-02-20 14:39:33,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 209 transitions. [2022-02-20 14:39:33,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:33,935 INFO L225 Difference]: With dead ends: 3913 [2022-02-20 14:39:33,935 INFO L226 Difference]: Without dead ends: 2279 [2022-02-20 14:39:33,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:33,937 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:33,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:33,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-02-20 14:39:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2022-02-20 14:39:33,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:33,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2279 states. Second operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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 14:39:33,980 INFO L74 IsIncluded]: Start isIncluded. First operand 2279 states. Second operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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 14:39:33,982 INFO L87 Difference]: Start difference. First operand 2279 states. Second operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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 14:39:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:34,184 INFO L93 Difference]: Finished difference Result 2279 states and 3588 transitions. [2022-02-20 14:39:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3588 transitions. [2022-02-20 14:39:34,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:34,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:34,190 INFO L74 IsIncluded]: Start isIncluded. First operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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 2279 states. [2022-02-20 14:39:34,192 INFO L87 Difference]: Start difference. First operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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 2279 states. [2022-02-20 14:39:34,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:34,407 INFO L93 Difference]: Finished difference Result 2279 states and 3588 transitions. [2022-02-20 14:39:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 2279 states and 3588 transitions. [2022-02-20 14:39:34,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:34,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:34,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:34,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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 14:39:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2022-02-20 14:39:34,570 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2022-02-20 14:39:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:34,571 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2022-02-20 14:39:34,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 14:39:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2022-02-20 14:39:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:34,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:34,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:34,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:39:34,573 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2022-02-20 14:39:34,574 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:34,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756178302] [2022-02-20 14:39:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:34,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:34,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {47917#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(16, 2);call #Ultimate.allocInit(12, 3); {47917#true} is VALID [2022-02-20 14:39:34,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {47917#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {47917#true} is VALID [2022-02-20 14:39:34,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {47917#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {47917#true} is VALID [2022-02-20 14:39:34,603 INFO L290 TraceCheckUtils]: 3: Hoare triple {47917#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {47917#true} is VALID [2022-02-20 14:39:34,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {47917#true} assume !(0 != main_~p1~0#1); {47917#true} is VALID [2022-02-20 14:39:34,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {47917#true} assume !(0 != main_~p2~0#1); {47917#true} is VALID [2022-02-20 14:39:34,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {47917#true} assume !(0 != main_~p3~0#1); {47917#true} is VALID [2022-02-20 14:39:34,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {47917#true} assume !(0 != main_~p4~0#1); {47917#true} is VALID [2022-02-20 14:39:34,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {47917#true} assume !(0 != main_~p5~0#1); {47917#true} is VALID [2022-02-20 14:39:34,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {47917#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:34,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {47919#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {47918#false} is VALID [2022-02-20 14:39:34,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {47918#false} assume 0 != main_~p7~0#1; {47918#false} is VALID [2022-02-20 14:39:34,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {47918#false} assume 1 != main_~lk7~0#1; {47918#false} is VALID [2022-02-20 14:39:34,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {47918#false} assume !false; {47918#false} is VALID [2022-02-20 14:39:34,610 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 14:39:34,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:34,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756178302] [2022-02-20 14:39:34,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756178302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:34,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:34,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:34,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231789749] [2022-02-20 14:39:34,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-02-20 14:39:34,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:34,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:34,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:34,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:34,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:34,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:34,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:34,629 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:35,057 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2022-02-20 14:39:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-02-20 14:39:35,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 14:39:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2022-02-20 14:39:35,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 204 transitions. [2022-02-20 14:39:35,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:35,363 INFO L225 Difference]: With dead ends: 3417 [2022-02-20 14:39:35,363 INFO L226 Difference]: Without dead ends: 2311 [2022-02-20 14:39:35,364 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:35,364 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:35,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:35,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-02-20 14:39:35,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2022-02-20 14:39:35,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:35,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2311 states. Second operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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 14:39:35,409 INFO L74 IsIncluded]: Start isIncluded. First operand 2311 states. Second operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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 14:39:35,412 INFO L87 Difference]: Start difference. First operand 2311 states. Second operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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 14:39:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:35,569 INFO L93 Difference]: Finished difference Result 2311 states and 3588 transitions. [2022-02-20 14:39:35,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3588 transitions. [2022-02-20 14:39:35,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:35,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:35,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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 2311 states. [2022-02-20 14:39:35,575 INFO L87 Difference]: Start difference. First operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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 2311 states. [2022-02-20 14:39:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:35,753 INFO L93 Difference]: Finished difference Result 2311 states and 3588 transitions. [2022-02-20 14:39:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2311 states and 3588 transitions. [2022-02-20 14:39:35,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:35,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:35,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:35,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:35,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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 14:39:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2022-02-20 14:39:35,913 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2022-02-20 14:39:35,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:35,913 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2022-02-20 14:39:35,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2022-02-20 14:39:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:35,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:35,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:35,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 14:39:35,916 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:35,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:35,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2022-02-20 14:39:35,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:35,917 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19913564] [2022-02-20 14:39:35,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:35,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:35,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {58436#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(16, 2);call #Ultimate.allocInit(12, 3); {58436#true} is VALID [2022-02-20 14:39:35,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {58436#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {58436#true} is VALID [2022-02-20 14:39:35,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {58436#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {58436#true} is VALID [2022-02-20 14:39:35,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {58436#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {58436#true} is VALID [2022-02-20 14:39:35,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {58436#true} assume !(0 != main_~p1~0#1); {58436#true} is VALID [2022-02-20 14:39:35,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {58436#true} assume !(0 != main_~p2~0#1); {58436#true} is VALID [2022-02-20 14:39:35,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {58436#true} assume !(0 != main_~p3~0#1); {58436#true} is VALID [2022-02-20 14:39:35,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {58436#true} assume !(0 != main_~p4~0#1); {58436#true} is VALID [2022-02-20 14:39:35,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {58436#true} assume !(0 != main_~p5~0#1); {58436#true} is VALID [2022-02-20 14:39:35,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {58436#true} assume !(0 != main_~p6~0#1); {58436#true} is VALID [2022-02-20 14:39:35,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {58436#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:35,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {58438#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {58437#false} is VALID [2022-02-20 14:39:35,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {58437#false} assume !false; {58437#false} is VALID [2022-02-20 14:39:35,954 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 14:39:35,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:35,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19913564] [2022-02-20 14:39:35,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19913564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:35,955 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:35,955 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:35,955 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758816504] [2022-02-20 14:39:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:35,956 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-02-20 14:39:35,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:35,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:35,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:35,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:35,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:35,980 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:36,530 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2022-02-20 14:39:36,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:36,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-02-20 14:39:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 14:39:36,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 14:39:36,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 14:39:36,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:37,143 INFO L225 Difference]: With dead ends: 4105 [2022-02-20 14:39:37,144 INFO L226 Difference]: Without dead ends: 4103 [2022-02-20 14:39:37,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:37,145 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:37,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-02-20 14:39:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2022-02-20 14:39:37,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:37,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4103 states. Second operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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 14:39:37,214 INFO L74 IsIncluded]: Start isIncluded. First operand 4103 states. Second operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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 14:39:37,216 INFO L87 Difference]: Start difference. First operand 4103 states. Second operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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 14:39:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:37,687 INFO L93 Difference]: Finished difference Result 4103 states and 6436 transitions. [2022-02-20 14:39:37,687 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6436 transitions. [2022-02-20 14:39:37,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:37,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:37,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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 4103 states. [2022-02-20 14:39:37,695 INFO L87 Difference]: Start difference. First operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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 4103 states. [2022-02-20 14:39:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:38,168 INFO L93 Difference]: Finished difference Result 4103 states and 6436 transitions. [2022-02-20 14:39:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6436 transitions. [2022-02-20 14:39:38,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:38,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:38,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:38,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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 14:39:38,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2022-02-20 14:39:38,547 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2022-02-20 14:39:38,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:38,547 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2022-02-20 14:39:38,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2022-02-20 14:39:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:38,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:38,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:38,550 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 14:39:38,550 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:38,550 INFO L85 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2022-02-20 14:39:38,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:38,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609789551] [2022-02-20 14:39:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:38,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:38,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {74283#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(16, 2);call #Ultimate.allocInit(12, 3); {74283#true} is VALID [2022-02-20 14:39:38,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {74283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {74283#true} is VALID [2022-02-20 14:39:38,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {74283#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {74283#true} is VALID [2022-02-20 14:39:38,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {74283#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {74283#true} is VALID [2022-02-20 14:39:38,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {74283#true} assume !(0 != main_~p1~0#1); {74283#true} is VALID [2022-02-20 14:39:38,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {74283#true} assume !(0 != main_~p2~0#1); {74283#true} is VALID [2022-02-20 14:39:38,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {74283#true} assume !(0 != main_~p3~0#1); {74283#true} is VALID [2022-02-20 14:39:38,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {74283#true} assume !(0 != main_~p4~0#1); {74283#true} is VALID [2022-02-20 14:39:38,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {74283#true} assume !(0 != main_~p5~0#1); {74283#true} is VALID [2022-02-20 14:39:38,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {74283#true} assume !(0 != main_~p6~0#1); {74283#true} is VALID [2022-02-20 14:39:38,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {74283#true} assume !(0 != main_~p7~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:38,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {74285#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {74284#false} is VALID [2022-02-20 14:39:38,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {74284#false} assume 1 != main_~lk7~0#1; {74284#false} is VALID [2022-02-20 14:39:38,579 INFO L290 TraceCheckUtils]: 24: Hoare triple {74284#false} assume !false; {74284#false} is VALID [2022-02-20 14:39:38,579 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 14:39:38,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:38,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609789551] [2022-02-20 14:39:38,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609789551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:38,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:38,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:38,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606016612] [2022-02-20 14:39:38,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-02-20 14:39:38,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:38,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:38,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:38,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:38,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:38,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:38,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:38,597 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:40,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,461 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2022-02-20 14:39:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:40,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-02-20 14:39:40,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2022-02-20 14:39:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2022-02-20 14:39:40,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2022-02-20 14:39:40,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,198 INFO L225 Difference]: With dead ends: 7753 [2022-02-20 14:39:41,198 INFO L226 Difference]: Without dead ends: 4487 [2022-02-20 14:39:41,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:41,203 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:41,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-02-20 14:39:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2022-02-20 14:39:41,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:41,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4487 states. Second operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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 14:39:41,294 INFO L74 IsIncluded]: Start isIncluded. First operand 4487 states. Second operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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 14:39:41,297 INFO L87 Difference]: Start difference. First operand 4487 states. Second operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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 14:39:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,859 INFO L93 Difference]: Finished difference Result 4487 states and 6724 transitions. [2022-02-20 14:39:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 6724 transitions. [2022-02-20 14:39:41,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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 4487 states. [2022-02-20 14:39:41,868 INFO L87 Difference]: Start difference. First operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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 4487 states. [2022-02-20 14:39:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,400 INFO L93 Difference]: Finished difference Result 4487 states and 6724 transitions. [2022-02-20 14:39:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4487 states and 6724 transitions. [2022-02-20 14:39:42,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:42,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:42,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:42,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:42,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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 14:39:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2022-02-20 14:39:42,990 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2022-02-20 14:39:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:42,990 INFO L470 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2022-02-20 14:39:42,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 14:39:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2022-02-20 14:39:42,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:42,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:42,993 INFO L514 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] [2022-02-20 14:39:42,993 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 14:39:42,993 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:42,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2022-02-20 14:39:42,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:42,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308430732] [2022-02-20 14:39:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:42,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:43,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {95826#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(16, 2);call #Ultimate.allocInit(12, 3); {95826#true} is VALID [2022-02-20 14:39:43,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {95826#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {95826#true} is VALID [2022-02-20 14:39:43,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {95826#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {95826#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {95826#true} assume !(0 != main_~p1~0#1); {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {95826#true} assume !(0 != main_~p2~0#1); {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {95826#true} assume !(0 != main_~p3~0#1); {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {95826#true} assume !(0 != main_~p4~0#1); {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {95826#true} assume !(0 != main_~p5~0#1); {95826#true} is VALID [2022-02-20 14:39:43,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {95826#true} assume !(0 != main_~p6~0#1); {95826#true} is VALID [2022-02-20 14:39:43,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {95826#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:43,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {95828#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {95827#false} is VALID [2022-02-20 14:39:43,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {95827#false} assume 0 != main_~p8~0#1; {95827#false} is VALID [2022-02-20 14:39:43,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {95827#false} assume 1 != main_~lk8~0#1; {95827#false} is VALID [2022-02-20 14:39:43,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {95827#false} assume !false; {95827#false} is VALID [2022-02-20 14:39:43,038 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 14:39:43,038 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:43,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308430732] [2022-02-20 14:39:43,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308430732] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:43,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:43,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:43,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271895718] [2022-02-20 14:39:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:43,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-02-20 14:39:43,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:43,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:43,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:43,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:43,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:43,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:43,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:43,057 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:44,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:44,458 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2022-02-20 14:39:44,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:44,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-02-20 14:39:44,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 14:39:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 14:39:44,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2022-02-20 14:39:44,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:45,201 INFO L225 Difference]: With dead ends: 6729 [2022-02-20 14:39:45,202 INFO L226 Difference]: Without dead ends: 4551 [2022-02-20 14:39:45,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:45,204 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:45,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:45,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2022-02-20 14:39:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2022-02-20 14:39:45,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:45,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4551 states. Second operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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 14:39:45,282 INFO L74 IsIncluded]: Start isIncluded. First operand 4551 states. Second operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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 14:39:45,286 INFO L87 Difference]: Start difference. First operand 4551 states. Second operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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 14:39:45,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:45,866 INFO L93 Difference]: Finished difference Result 4551 states and 6724 transitions. [2022-02-20 14:39:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4551 states and 6724 transitions. [2022-02-20 14:39:45,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:45,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:45,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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 4551 states. [2022-02-20 14:39:45,876 INFO L87 Difference]: Start difference. First operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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 4551 states. [2022-02-20 14:39:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,434 INFO L93 Difference]: Finished difference Result 4551 states and 6724 transitions. [2022-02-20 14:39:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4551 states and 6724 transitions. [2022-02-20 14:39:46,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:46,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:46,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:46,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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 14:39:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2022-02-20 14:39:47,064 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2022-02-20 14:39:47,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,064 INFO L470 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2022-02-20 14:39:47,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:47,065 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2022-02-20 14:39:47,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:47,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,067 INFO L514 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] [2022-02-20 14:39:47,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 14:39:47,067 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,068 INFO L85 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2022-02-20 14:39:47,068 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144028358] [2022-02-20 14:39:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {116537#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(16, 2);call #Ultimate.allocInit(12, 3); {116537#true} is VALID [2022-02-20 14:39:47,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {116537#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {116537#true} is VALID [2022-02-20 14:39:47,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {116537#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {116537#true} is VALID [2022-02-20 14:39:47,107 INFO L290 TraceCheckUtils]: 3: Hoare triple {116537#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {116537#true} is VALID [2022-02-20 14:39:47,107 INFO L290 TraceCheckUtils]: 4: Hoare triple {116537#true} assume !(0 != main_~p1~0#1); {116537#true} is VALID [2022-02-20 14:39:47,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {116537#true} assume !(0 != main_~p2~0#1); {116537#true} is VALID [2022-02-20 14:39:47,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {116537#true} assume !(0 != main_~p3~0#1); {116537#true} is VALID [2022-02-20 14:39:47,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {116537#true} assume !(0 != main_~p4~0#1); {116537#true} is VALID [2022-02-20 14:39:47,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {116537#true} assume !(0 != main_~p5~0#1); {116537#true} is VALID [2022-02-20 14:39:47,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {116537#true} assume !(0 != main_~p6~0#1); {116537#true} is VALID [2022-02-20 14:39:47,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {116537#true} assume !(0 != main_~p7~0#1); {116537#true} is VALID [2022-02-20 14:39:47,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {116537#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:47,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {116539#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {116538#false} is VALID [2022-02-20 14:39:47,113 INFO L290 TraceCheckUtils]: 25: Hoare triple {116538#false} assume !false; {116538#false} is VALID [2022-02-20 14:39:47,113 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 14:39:47,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144028358] [2022-02-20 14:39:47,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144028358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363757978] [2022-02-20 14:39:47,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-02-20 14:39:47,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:47,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,134 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:48,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,974 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2022-02-20 14:39:48,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:48,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-02-20 14:39:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 14:39:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 14:39:48,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 14:39:49,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,978 INFO L225 Difference]: With dead ends: 7945 [2022-02-20 14:39:50,979 INFO L226 Difference]: Without dead ends: 7943 [2022-02-20 14:39:50,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:39:50,980 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:50,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2022-02-20 14:39:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2022-02-20 14:39:51,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7943 states. Second operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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 14:39:51,087 INFO L74 IsIncluded]: Start isIncluded. First operand 7943 states. Second operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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 14:39:51,094 INFO L87 Difference]: Start difference. First operand 7943 states. Second operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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 14:39:52,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,919 INFO L93 Difference]: Finished difference Result 7943 states and 11844 transitions. [2022-02-20 14:39:52,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 11844 transitions. [2022-02-20 14:39:52,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,930 INFO L74 IsIncluded]: Start isIncluded. First operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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 7943 states. [2022-02-20 14:39:52,933 INFO L87 Difference]: Start difference. First operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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 7943 states. [2022-02-20 14:39:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,505 INFO L93 Difference]: Finished difference Result 7943 states and 11844 transitions. [2022-02-20 14:39:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 7943 states and 11844 transitions. [2022-02-20 14:39:54,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:54,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:54,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:54,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:54,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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 14:39:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2022-02-20 14:39:55,898 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2022-02-20 14:39:55,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:55,899 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2022-02-20 14:39:55,899 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2022-02-20 14:39:55,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:55,902 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:55,902 INFO L514 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] [2022-02-20 14:39:55,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 14:39:55,903 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:55,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:55,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2022-02-20 14:39:55,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:55,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425938458] [2022-02-20 14:39:55,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:55,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:55,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {147424#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(16, 2);call #Ultimate.allocInit(12, 3); {147424#true} is VALID [2022-02-20 14:39:55,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {147424#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {147424#true} is VALID [2022-02-20 14:39:55,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {147424#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {147424#true} is VALID [2022-02-20 14:39:55,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {147424#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {147424#true} is VALID [2022-02-20 14:39:55,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {147424#true} assume !(0 != main_~p1~0#1); {147424#true} is VALID [2022-02-20 14:39:55,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {147424#true} assume !(0 != main_~p2~0#1); {147424#true} is VALID [2022-02-20 14:39:55,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {147424#true} assume !(0 != main_~p3~0#1); {147424#true} is VALID [2022-02-20 14:39:55,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {147424#true} assume !(0 != main_~p4~0#1); {147424#true} is VALID [2022-02-20 14:39:55,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {147424#true} assume !(0 != main_~p5~0#1); {147424#true} is VALID [2022-02-20 14:39:55,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {147424#true} assume !(0 != main_~p6~0#1); {147424#true} is VALID [2022-02-20 14:39:55,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {147424#true} assume !(0 != main_~p7~0#1); {147424#true} is VALID [2022-02-20 14:39:55,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {147424#true} assume !(0 != main_~p8~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:55,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {147426#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {147425#false} is VALID [2022-02-20 14:39:55,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {147425#false} assume 1 != main_~lk8~0#1; {147425#false} is VALID [2022-02-20 14:39:55,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {147425#false} assume !false; {147425#false} is VALID [2022-02-20 14:39:55,961 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 14:39:55,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:55,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425938458] [2022-02-20 14:39:55,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425938458] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:55,962 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:55,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:55,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129657767] [2022-02-20 14:39:55,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:55,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-02-20 14:39:55,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:55,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:39:55,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:55,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:55,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:55,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:55,981 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:40:02,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:02,680 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2022-02-20 14:40:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:02,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-02-20 14:40:02,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:02,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:40:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-02-20 14:40:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:40:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-02-20 14:40:02,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2022-02-20 14:40:02,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:05,151 INFO L225 Difference]: With dead ends: 15369 [2022-02-20 14:40:05,152 INFO L226 Difference]: Without dead ends: 8839 [2022-02-20 14:40:05,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:40:05,156 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:05,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:05,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-02-20 14:40:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2022-02-20 14:40:05,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:05,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8839 states. Second operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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 14:40:05,294 INFO L74 IsIncluded]: Start isIncluded. First operand 8839 states. Second operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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 14:40:05,302 INFO L87 Difference]: Start difference. First operand 8839 states. Second operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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 14:40:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:07,466 INFO L93 Difference]: Finished difference Result 8839 states and 12548 transitions. [2022-02-20 14:40:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 12548 transitions. [2022-02-20 14:40:07,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:07,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:07,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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 8839 states. [2022-02-20 14:40:07,485 INFO L87 Difference]: Start difference. First operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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 8839 states. [2022-02-20 14:40:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:09,480 INFO L93 Difference]: Finished difference Result 8839 states and 12548 transitions. [2022-02-20 14:40:09,480 INFO L276 IsEmpty]: Start isEmpty. Operand 8839 states and 12548 transitions. [2022-02-20 14:40:09,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:09,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:09,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:09,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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 14:40:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2022-02-20 14:40:11,648 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2022-02-20 14:40:11,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:11,649 INFO L470 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2022-02-20 14:40:11,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 14:40:11,649 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2022-02-20 14:40:11,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:40:11,653 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:11,653 INFO L514 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] [2022-02-20 14:40:11,653 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 14:40:11,655 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:11,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2022-02-20 14:40:11,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:11,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678269739] [2022-02-20 14:40:11,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:11,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:11,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {189959#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(16, 2);call #Ultimate.allocInit(12, 3); {189959#true} is VALID [2022-02-20 14:40:11,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {189959#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {189959#true} is VALID [2022-02-20 14:40:11,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {189959#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {189959#true} is VALID [2022-02-20 14:40:11,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {189959#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {189959#true} is VALID [2022-02-20 14:40:11,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {189959#true} assume !(0 != main_~p1~0#1); {189959#true} is VALID [2022-02-20 14:40:11,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {189959#true} assume !(0 != main_~p2~0#1); {189959#true} is VALID [2022-02-20 14:40:11,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {189959#true} assume !(0 != main_~p3~0#1); {189959#true} is VALID [2022-02-20 14:40:11,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {189959#true} assume !(0 != main_~p4~0#1); {189959#true} is VALID [2022-02-20 14:40:11,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {189959#true} assume !(0 != main_~p5~0#1); {189959#true} is VALID [2022-02-20 14:40:11,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {189959#true} assume !(0 != main_~p6~0#1); {189959#true} is VALID [2022-02-20 14:40:11,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {189959#true} assume !(0 != main_~p7~0#1); {189959#true} is VALID [2022-02-20 14:40:11,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {189959#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:11,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {189961#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {189960#false} is VALID [2022-02-20 14:40:11,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {189960#false} assume 0 != main_~p9~0#1; {189960#false} is VALID [2022-02-20 14:40:11,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {189960#false} assume 1 != main_~lk9~0#1; {189960#false} is VALID [2022-02-20 14:40:11,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {189960#false} assume !false; {189960#false} is VALID [2022-02-20 14:40:11,694 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 14:40:11,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:11,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678269739] [2022-02-20 14:40:11,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678269739] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:11,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:11,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:11,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058731137] [2022-02-20 14:40:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:11,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-02-20 14:40:11,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:11,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:11,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:11,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:11,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:11,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:11,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:11,713 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:17,063 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2022-02-20 14:40:17,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:17,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-02-20 14:40:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:17,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:17,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 14:40:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:17,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 14:40:17,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2022-02-20 14:40:17,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:19,812 INFO L225 Difference]: With dead ends: 13257 [2022-02-20 14:40:19,812 INFO L226 Difference]: Without dead ends: 8967 [2022-02-20 14:40:19,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:40:19,815 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:19,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2022-02-20 14:40:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2022-02-20 14:40:19,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:19,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8967 states. Second operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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 14:40:19,956 INFO L74 IsIncluded]: Start isIncluded. First operand 8967 states. Second operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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 14:40:19,968 INFO L87 Difference]: Start difference. First operand 8967 states. Second operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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 14:40:22,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:22,061 INFO L93 Difference]: Finished difference Result 8967 states and 12548 transitions. [2022-02-20 14:40:22,061 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 12548 transitions. [2022-02-20 14:40:22,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:22,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:22,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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 8967 states. [2022-02-20 14:40:22,089 INFO L87 Difference]: Start difference. First operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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 8967 states. [2022-02-20 14:40:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:24,431 INFO L93 Difference]: Finished difference Result 8967 states and 12548 transitions. [2022-02-20 14:40:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 8967 states and 12548 transitions. [2022-02-20 14:40:24,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:24,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:24,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:24,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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 14:40:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2022-02-20 14:40:26,535 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2022-02-20 14:40:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:26,535 INFO L470 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2022-02-20 14:40:26,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2022-02-20 14:40:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:40:26,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:26,538 INFO L514 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] [2022-02-20 14:40:26,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 14:40:26,538 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:26,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2022-02-20 14:40:26,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:26,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860014267] [2022-02-20 14:40:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:26,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:26,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {230766#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(16, 2);call #Ultimate.allocInit(12, 3); {230766#true} is VALID [2022-02-20 14:40:26,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {230766#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; {230766#true} is VALID [2022-02-20 14:40:26,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {230766#true} assume !false;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 3: Hoare triple {230766#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {230766#true} assume !(0 != main_~p1~0#1); {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {230766#true} assume !(0 != main_~p2~0#1); {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {230766#true} assume !(0 != main_~p3~0#1); {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {230766#true} assume !(0 != main_~p4~0#1); {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {230766#true} assume !(0 != main_~p5~0#1); {230766#true} is VALID [2022-02-20 14:40:26,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {230766#true} assume !(0 != main_~p6~0#1); {230766#true} is VALID [2022-02-20 14:40:26,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {230766#true} assume !(0 != main_~p7~0#1); {230766#true} is VALID [2022-02-20 14:40:26,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {230766#true} assume !(0 != main_~p8~0#1); {230766#true} is VALID [2022-02-20 14:40:26,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {230766#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p11~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:26,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {230768#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {230767#false} is VALID [2022-02-20 14:40:26,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {230767#false} assume !false; {230767#false} is VALID [2022-02-20 14:40:26,572 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 14:40:26,572 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:26,572 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860014267] [2022-02-20 14:40:26,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860014267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:26,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:26,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:26,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368688698] [2022-02-20 14:40:26,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:26,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-02-20 14:40:26,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:26,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:26,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:26,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:26,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:26,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:26,590 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:33,391 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2022-02-20 14:40:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:33,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-02-20 14:40:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:33,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 14:40:33,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 14:40:33,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 14:40:33,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2022-02-20 14:40:33,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.