./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/ntdrivers-simplified/cdaudio_simpl1.cil-1.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 bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:53:29,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:53:29,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:53:29,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:53:29,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:53:29,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:53:29,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:53:29,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:53:29,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:53:29,228 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:53:29,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:53:29,230 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:53:29,230 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:53:29,231 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:53:29,232 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:53:29,234 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:53:29,235 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:53:29,236 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:53:29,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:53:29,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:53:29,241 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:53:29,242 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:53:29,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:53:29,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:53:29,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:53:29,249 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:53:29,249 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:53:29,249 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:53:29,250 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:53:29,250 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:53:29,251 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:53:29,251 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:53:29,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:53:29,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:53:29,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:53:29,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:53:29,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:53:29,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:53:29,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:53:29,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:53:29,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:53:29,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:53:29,257 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:53:29,279 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:53:29,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:53:29,280 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:53:29,280 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:53:29,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:53:29,281 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:53:29,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:53:29,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:53:29,281 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:53:29,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:53:29,282 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:53:29,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:53:29,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:53:29,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:53:29,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:53:29,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:53:29,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:53:29,283 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:53:29,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:53:29,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:53:29,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:53:29,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:53:29,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:53:29,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:53:29,286 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:53:29,286 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:53:29,286 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:53:29,286 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 -> bfc29f03d3be9b41eb07ac14f0f7eac45bf3a60a4a6601e3132f720b72534d53 [2022-07-19 10:53:29,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:53:29,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:53:29,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:53:29,460 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:53:29,471 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:53:29,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-07-19 10:53:29,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7be3f03d/66074700a6824d42a52fa92ea395dbad/FLAG32781491d [2022-07-19 10:53:29,924 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:53:29,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/cdaudio_simpl1.cil-1.c [2022-07-19 10:53:29,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7be3f03d/66074700a6824d42a52fa92ea395dbad/FLAG32781491d [2022-07-19 10:53:30,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7be3f03d/66074700a6824d42a52fa92ea395dbad [2022-07-19 10:53:30,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:53:30,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:53:30,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:53:30,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:53:30,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:53:30,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d3ad82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30, skipping insertion in model container [2022-07-19 10:53:30,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:53:30,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:53:30,526 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/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-07-19 10:53:30,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:53:30,665 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:53:30,674 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/ntdrivers-simplified/cdaudio_simpl1.cil-1.c[2074,2087] [2022-07-19 10:53:30,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:53:30,748 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:53:30,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30 WrapperNode [2022-07-19 10:53:30,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:53:30,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:53:30,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:53:30,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:53:30,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,809 INFO L137 Inliner]: procedures = 41, calls = 108, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 1583 [2022-07-19 10:53:30,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:53:30,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:53:30,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:53:30,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:53:30,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:53:30,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:53:30,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:53:30,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:53:30,852 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (1/1) ... [2022-07-19 10:53:30,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:53:30,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:53:30,872 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-07-19 10:53:30,878 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-07-19 10:53:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-07-19 10:53:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-07-19 10:53:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:53:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-07-19 10:53:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-07-19 10:53:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-19 10:53:30,902 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-19 10:53:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-07-19 10:53:30,904 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-07-19 10:53:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-19 10:53:30,904 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-19 10:53:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-19 10:53:30,904 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-19 10:53:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-07-19 10:53:30,904 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-07-19 10:53:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-07-19 10:53:30,905 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-07-19 10:53:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-07-19 10:53:30,905 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-07-19 10:53:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-19 10:53:30,905 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-19 10:53:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:53:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-19 10:53:30,905 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-19 10:53:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-07-19 10:53:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-07-19 10:53:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:53:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:53:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-07-19 10:53:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-07-19 10:53:31,149 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:53:31,161 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:53:31,294 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,334 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-19 10:53:31,334 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-19 10:53:31,376 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,386 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-19 10:53:31,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-19 10:53:31,391 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,392 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,394 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,402 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,412 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,414 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,417 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:53:31,756 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: CdAudioPnp_#res#1 := 0; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##258: assume !false; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##257: assume false; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##286: assume !false; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##285: assume false; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !false; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume false; [2022-07-19 10:53:31,757 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##133: assume false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##134: assume !false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##331: assume false; [2022-07-19 10:53:31,758 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##332: assume !false; [2022-07-19 10:53:31,783 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:53:31,790 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:53:31,791 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:53:31,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:53:31 BoogieIcfgContainer [2022-07-19 10:53:31,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:53:31,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:53:31,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:53:31,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:53:31,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:53:30" (1/3) ... [2022-07-19 10:53:31,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddfe2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:53:31, skipping insertion in model container [2022-07-19 10:53:31,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:53:30" (2/3) ... [2022-07-19 10:53:31,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ddfe2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:53:31, skipping insertion in model container [2022-07-19 10:53:31,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:53:31" (3/3) ... [2022-07-19 10:53:31,798 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-1.c [2022-07-19 10:53:31,808 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:53:31,809 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:53:31,847 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:53:31,852 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ce6ef36, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11e14c9f [2022-07-19 10:53:31,852 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:53:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) [2022-07-19 10:53:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 10:53:31,861 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:31,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:31,862 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:31,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1469618458, now seen corresponding path program 1 times [2022-07-19 10:53:31,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871369968] [2022-07-19 10:53:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:32,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:32,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871369968] [2022-07-19 10:53:32,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871369968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:32,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:32,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013070792] [2022-07-19 10:53:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:32,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:32,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:32,039 INFO L87 Difference]: Start difference. First operand has 470 states, 368 states have (on average 1.5081521739130435) internal successors, (555), 387 states have internal predecessors, (555), 87 states have call successors, (87), 13 states have call predecessors, (87), 13 states have return successors, (87), 82 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:32,204 INFO L93 Difference]: Finished difference Result 813 states and 1302 transitions. [2022-07-19 10:53:32,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:32,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 10:53:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:32,218 INFO L225 Difference]: With dead ends: 813 [2022-07-19 10:53:32,218 INFO L226 Difference]: Without dead ends: 463 [2022-07-19 10:53:32,225 INFO L412 NwaCegarLoop]: 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-07-19 10:53:32,234 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 8 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:32,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1357 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2022-07-19 10:53:32,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2022-07-19 10:53:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 363 states have (on average 1.4765840220385675) internal successors, (536), 380 states have internal predecessors, (536), 87 states have call successors, (87), 13 states have call predecessors, (87), 12 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2022-07-19 10:53:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 694 transitions. [2022-07-19 10:53:32,305 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 694 transitions. Word has length 13 [2022-07-19 10:53:32,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:32,305 INFO L495 AbstractCegarLoop]: Abstraction has 463 states and 694 transitions. [2022-07-19 10:53:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,306 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 694 transitions. [2022-07-19 10:53:32,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 10:53:32,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:32,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:32,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:53:32,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:32,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:32,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1712839840, now seen corresponding path program 1 times [2022-07-19 10:53:32,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:32,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092935290] [2022-07-19 10:53:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:32,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:32,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-07-19 10:53:32,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:32,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092935290] [2022-07-19 10:53:32,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092935290] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:32,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:32,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:32,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483673839] [2022-07-19 10:53:32,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:32,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:32,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:32,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:32,362 INFO L87 Difference]: Start difference. First operand 463 states and 694 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:32,473 INFO L93 Difference]: Finished difference Result 708 states and 1039 transitions. [2022-07-19 10:53:32,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:32,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 10:53:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:32,477 INFO L225 Difference]: With dead ends: 708 [2022-07-19 10:53:32,477 INFO L226 Difference]: Without dead ends: 601 [2022-07-19 10:53:32,478 INFO L412 NwaCegarLoop]: 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-07-19 10:53:32,478 INFO L413 NwaCegarLoop]: 828 mSDtfsCounter, 569 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:32,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1055 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-07-19 10:53:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 581. [2022-07-19 10:53:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 467 states have (on average 1.436830835117773) internal successors, (671), 470 states have internal predecessors, (671), 93 states have call successors, (93), 21 states have call predecessors, (93), 20 states have return successors, (97), 91 states have call predecessors, (97), 81 states have call successors, (97) [2022-07-19 10:53:32,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 861 transitions. [2022-07-19 10:53:32,513 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 861 transitions. Word has length 15 [2022-07-19 10:53:32,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:32,514 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 861 transitions. [2022-07-19 10:53:32,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 861 transitions. [2022-07-19 10:53:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:53:32,515 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:32,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:32,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:53:32,516 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:32,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1900703522, now seen corresponding path program 1 times [2022-07-19 10:53:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:32,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075474698] [2022-07-19 10:53:32,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:32,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:32,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:32,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:32,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075474698] [2022-07-19 10:53:32,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075474698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:32,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:32,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:32,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587739976] [2022-07-19 10:53:32,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:32,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:32,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:32,561 INFO L87 Difference]: Start difference. First operand 581 states and 861 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:32,585 INFO L93 Difference]: Finished difference Result 864 states and 1250 transitions. [2022-07-19 10:53:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:53:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:32,589 INFO L225 Difference]: With dead ends: 864 [2022-07-19 10:53:32,589 INFO L226 Difference]: Without dead ends: 727 [2022-07-19 10:53:32,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-07-19 10:53:32,591 INFO L413 NwaCegarLoop]: 684 mSDtfsCounter, 608 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 608 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:32,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [608 Valid, 874 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-07-19 10:53:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 689. [2022-07-19 10:53:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 565 states have (on average 1.4336283185840708) internal successors, (810), 564 states have internal predecessors, (810), 94 states have call successors, (94), 26 states have call predecessors, (94), 29 states have return successors, (110), 98 states have call predecessors, (110), 85 states have call successors, (110) [2022-07-19 10:53:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1014 transitions. [2022-07-19 10:53:32,614 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1014 transitions. Word has length 19 [2022-07-19 10:53:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:32,615 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1014 transitions. [2022-07-19 10:53:32,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1014 transitions. [2022-07-19 10:53:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-19 10:53:32,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:32,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:32,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:53:32,617 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:32,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2011147442, now seen corresponding path program 1 times [2022-07-19 10:53:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:32,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465618644] [2022-07-19 10:53:32,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:32,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465618644] [2022-07-19 10:53:32,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465618644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:32,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:32,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902319285] [2022-07-19 10:53:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:32,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:32,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:32,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:32,648 INFO L87 Difference]: Start difference. First operand 689 states and 1014 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:32,744 INFO L93 Difference]: Finished difference Result 1296 states and 1967 transitions. [2022-07-19 10:53:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:32,744 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-19 10:53:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:32,749 INFO L225 Difference]: With dead ends: 1296 [2022-07-19 10:53:32,749 INFO L226 Difference]: Without dead ends: 1061 [2022-07-19 10:53:32,750 INFO L412 NwaCegarLoop]: 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-07-19 10:53:32,750 INFO L413 NwaCegarLoop]: 1012 mSDtfsCounter, 341 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1631 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:32,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1631 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:32,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2022-07-19 10:53:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 821. [2022-07-19 10:53:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 674 states have (on average 1.4347181008902077) internal successors, (967), 672 states have internal predecessors, (967), 107 states have call successors, (107), 34 states have call predecessors, (107), 39 states have return successors, (172), 114 states have call predecessors, (172), 98 states have call successors, (172) [2022-07-19 10:53:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1246 transitions. [2022-07-19 10:53:32,781 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1246 transitions. Word has length 21 [2022-07-19 10:53:32,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:32,781 INFO L495 AbstractCegarLoop]: Abstraction has 821 states and 1246 transitions. [2022-07-19 10:53:32,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1246 transitions. [2022-07-19 10:53:32,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-19 10:53:32,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:32,783 INFO L195 NwaCegarLoop]: 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-07-19 10:53:32,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:53:32,783 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:32,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:32,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1977476652, now seen corresponding path program 1 times [2022-07-19 10:53:32,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:32,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457581651] [2022-07-19 10:53:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:32,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:32,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:32,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457581651] [2022-07-19 10:53:32,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457581651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:32,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:32,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:32,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328774975] [2022-07-19 10:53:32,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:32,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:32,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:32,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:32,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:32,853 INFO L87 Difference]: Start difference. First operand 821 states and 1246 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:33,126 INFO L93 Difference]: Finished difference Result 1378 states and 2097 transitions. [2022-07-19 10:53:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:53:33,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-19 10:53:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:33,129 INFO L225 Difference]: With dead ends: 1378 [2022-07-19 10:53:33,129 INFO L226 Difference]: Without dead ends: 833 [2022-07-19 10:53:33,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:33,131 INFO L413 NwaCegarLoop]: 712 mSDtfsCounter, 1042 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 866 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2022-07-19 10:53:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 809. [2022-07-19 10:53:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 664 states have (on average 1.4292168674698795) internal successors, (949), 662 states have internal predecessors, (949), 105 states have call successors, (105), 32 states have call predecessors, (105), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-07-19 10:53:33,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1222 transitions. [2022-07-19 10:53:33,155 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1222 transitions. Word has length 22 [2022-07-19 10:53:33,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:33,156 INFO L495 AbstractCegarLoop]: Abstraction has 809 states and 1222 transitions. [2022-07-19 10:53:33,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1222 transitions. [2022-07-19 10:53:33,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 10:53:33,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:33,157 INFO L195 NwaCegarLoop]: 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-07-19 10:53:33,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:53:33,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:33,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:33,158 INFO L85 PathProgramCache]: Analyzing trace with hash -401986458, now seen corresponding path program 1 times [2022-07-19 10:53:33,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:33,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858447650] [2022-07-19 10:53:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:33,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:33,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:33,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858447650] [2022-07-19 10:53:33,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858447650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:33,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:33,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994476272] [2022-07-19 10:53:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:33,179 INFO L87 Difference]: Start difference. First operand 809 states and 1222 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:33,223 INFO L93 Difference]: Finished difference Result 812 states and 1224 transitions. [2022-07-19 10:53:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:33,223 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-19 10:53:33,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:33,226 INFO L225 Difference]: With dead ends: 812 [2022-07-19 10:53:33,226 INFO L226 Difference]: Without dead ends: 808 [2022-07-19 10:53:33,227 INFO L412 NwaCegarLoop]: 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-07-19 10:53:33,227 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 22 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:33,228 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1258 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-19 10:53:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 808. [2022-07-19 10:53:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 664 states have (on average 1.4262048192771084) internal successors, (947), 661 states have internal predecessors, (947), 104 states have call successors, (104), 32 states have call predecessors, (104), 39 states have return successors, (168), 114 states have call predecessors, (168), 96 states have call successors, (168) [2022-07-19 10:53:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1219 transitions. [2022-07-19 10:53:33,256 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1219 transitions. Word has length 23 [2022-07-19 10:53:33,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:33,256 INFO L495 AbstractCegarLoop]: Abstraction has 808 states and 1219 transitions. [2022-07-19 10:53:33,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,256 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1219 transitions. [2022-07-19 10:53:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:53:33,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:33,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:33,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:53:33,258 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:33,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash 18720905, now seen corresponding path program 1 times [2022-07-19 10:53:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:33,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55680791] [2022-07-19 10:53:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:33,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:33,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:33,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55680791] [2022-07-19 10:53:33,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55680791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:33,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:33,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070412996] [2022-07-19 10:53:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:33,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:33,301 INFO L87 Difference]: Start difference. First operand 808 states and 1219 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:33,375 INFO L93 Difference]: Finished difference Result 1228 states and 1788 transitions. [2022-07-19 10:53:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-19 10:53:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:33,379 INFO L225 Difference]: With dead ends: 1228 [2022-07-19 10:53:33,379 INFO L226 Difference]: Without dead ends: 812 [2022-07-19 10:53:33,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:33,380 INFO L413 NwaCegarLoop]: 766 mSDtfsCounter, 323 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:33,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1958 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2022-07-19 10:53:33,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 683. [2022-07-19 10:53:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 560 states have (on average 1.4089285714285715) internal successors, (789), 559 states have internal predecessors, (789), 89 states have call successors, (89), 28 states have call predecessors, (89), 33 states have return successors, (109), 95 states have call predecessors, (109), 81 states have call successors, (109) [2022-07-19 10:53:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 987 transitions. [2022-07-19 10:53:33,399 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 987 transitions. Word has length 28 [2022-07-19 10:53:33,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:33,399 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 987 transitions. [2022-07-19 10:53:33,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 987 transitions. [2022-07-19 10:53:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:53:33,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:33,401 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:33,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:53:33,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:33,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:33,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1728135655, now seen corresponding path program 1 times [2022-07-19 10:53:33,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:33,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891620547] [2022-07-19 10:53:33,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:33,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:33,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:33,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891620547] [2022-07-19 10:53:33,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891620547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:33,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:33,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282578286] [2022-07-19 10:53:33,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:33,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:33,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:33,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:33,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:33,427 INFO L87 Difference]: Start difference. First operand 683 states and 987 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:33,452 INFO L93 Difference]: Finished difference Result 768 states and 1098 transitions. [2022-07-19 10:53:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:33,453 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-19 10:53:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:33,455 INFO L225 Difference]: With dead ends: 768 [2022-07-19 10:53:33,455 INFO L226 Difference]: Without dead ends: 748 [2022-07-19 10:53:33,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-07-19 10:53:33,456 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 628 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:33,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 721 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:33,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2022-07-19 10:53:33,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 711. [2022-07-19 10:53:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 586 states have (on average 1.418088737201365) internal successors, (831), 592 states have internal predecessors, (831), 89 states have call successors, (89), 29 states have call predecessors, (89), 35 states have return successors, (104), 89 states have call predecessors, (104), 82 states have call successors, (104) [2022-07-19 10:53:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1024 transitions. [2022-07-19 10:53:33,480 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1024 transitions. Word has length 29 [2022-07-19 10:53:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:33,481 INFO L495 AbstractCegarLoop]: Abstraction has 711 states and 1024 transitions. [2022-07-19 10:53:33,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1024 transitions. [2022-07-19 10:53:33,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:53:33,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:33,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:33,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:53:33,483 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:33,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:33,483 INFO L85 PathProgramCache]: Analyzing trace with hash -881374565, now seen corresponding path program 1 times [2022-07-19 10:53:33,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:33,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515179997] [2022-07-19 10:53:33,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:33,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:33,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:53:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:33,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:33,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:33,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515179997] [2022-07-19 10:53:33,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515179997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:33,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:33,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:33,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183281581] [2022-07-19 10:53:33,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:33,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:33,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:33,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:33,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:33,518 INFO L87 Difference]: Start difference. First operand 711 states and 1024 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:33,690 INFO L93 Difference]: Finished difference Result 1007 states and 1455 transitions. [2022-07-19 10:53:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-19 10:53:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:33,694 INFO L225 Difference]: With dead ends: 1007 [2022-07-19 10:53:33,694 INFO L226 Difference]: Without dead ends: 780 [2022-07-19 10:53:33,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:33,695 INFO L413 NwaCegarLoop]: 732 mSDtfsCounter, 254 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:33,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1782 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-07-19 10:53:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 694. [2022-07-19 10:53:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4133099824868651) internal successors, (807), 579 states have internal predecessors, (807), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-07-19 10:53:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 995 transitions. [2022-07-19 10:53:33,731 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 995 transitions. Word has length 35 [2022-07-19 10:53:33,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:33,731 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 995 transitions. [2022-07-19 10:53:33,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 995 transitions. [2022-07-19 10:53:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-19 10:53:33,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:33,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:33,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:53:33,734 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1008894041, now seen corresponding path program 1 times [2022-07-19 10:53:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:33,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404706071] [2022-07-19 10:53:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:33,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404706071] [2022-07-19 10:53:33,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404706071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:33,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:33,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:33,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305098133] [2022-07-19 10:53:33,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:33,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:33,780 INFO L87 Difference]: Start difference. First operand 694 states and 995 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:33,991 INFO L93 Difference]: Finished difference Result 754 states and 1071 transitions. [2022-07-19 10:53:33,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:53:33,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-19 10:53:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:33,994 INFO L225 Difference]: With dead ends: 754 [2022-07-19 10:53:33,995 INFO L226 Difference]: Without dead ends: 712 [2022-07-19 10:53:33,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:33,996 INFO L413 NwaCegarLoop]: 647 mSDtfsCounter, 696 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:33,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1109 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-19 10:53:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 694. [2022-07-19 10:53:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 571 states have (on average 1.4098073555166375) internal successors, (805), 579 states have internal predecessors, (805), 88 states have call successors, (88), 28 states have call predecessors, (88), 34 states have return successors, (100), 86 states have call predecessors, (100), 81 states have call successors, (100) [2022-07-19 10:53:34,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 993 transitions. [2022-07-19 10:53:34,021 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 993 transitions. Word has length 32 [2022-07-19 10:53:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:34,021 INFO L495 AbstractCegarLoop]: Abstraction has 694 states and 993 transitions. [2022-07-19 10:53:34,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 993 transitions. [2022-07-19 10:53:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:53:34,023 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:34,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:34,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:53:34,023 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1219758973, now seen corresponding path program 1 times [2022-07-19 10:53:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:34,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899696562] [2022-07-19 10:53:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:34,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 10:53:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:34,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899696562] [2022-07-19 10:53:34,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899696562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:34,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:34,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:34,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16179419] [2022-07-19 10:53:34,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:34,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:34,047 INFO L87 Difference]: Start difference. First operand 694 states and 993 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:34,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:34,201 INFO L93 Difference]: Finished difference Result 779 states and 1121 transitions. [2022-07-19 10:53:34,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:34,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-19 10:53:34,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:34,204 INFO L225 Difference]: With dead ends: 779 [2022-07-19 10:53:34,204 INFO L226 Difference]: Without dead ends: 719 [2022-07-19 10:53:34,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:34,205 INFO L413 NwaCegarLoop]: 653 mSDtfsCounter, 706 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:34,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1259 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:34,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-07-19 10:53:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 683. [2022-07-19 10:53:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 564 states have (on average 1.4113475177304964) internal successors, (796), 572 states have internal predecessors, (796), 86 states have call successors, (86), 26 states have call predecessors, (86), 32 states have return successors, (98), 84 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-19 10:53:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 980 transitions. [2022-07-19 10:53:34,225 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 980 transitions. Word has length 36 [2022-07-19 10:53:34,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:34,225 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 980 transitions. [2022-07-19 10:53:34,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 980 transitions. [2022-07-19 10:53:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:53:34,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:34,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:34,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:53:34,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:34,227 INFO L85 PathProgramCache]: Analyzing trace with hash 138802018, now seen corresponding path program 1 times [2022-07-19 10:53:34,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:34,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706139613] [2022-07-19 10:53:34,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:34,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:34,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:34,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:34,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706139613] [2022-07-19 10:53:34,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706139613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:34,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:34,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:53:34,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515467244] [2022-07-19 10:53:34,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:34,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:53:34,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:34,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:53:34,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:53:34,246 INFO L87 Difference]: Start difference. First operand 683 states and 980 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:34,306 INFO L93 Difference]: Finished difference Result 851 states and 1212 transitions. [2022-07-19 10:53:34,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:53:34,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:53:34,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:34,309 INFO L225 Difference]: With dead ends: 851 [2022-07-19 10:53:34,309 INFO L226 Difference]: Without dead ends: 835 [2022-07-19 10:53:34,310 INFO L412 NwaCegarLoop]: 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-07-19 10:53:34,310 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 135 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:34,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1363 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-07-19 10:53:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 734. [2022-07-19 10:53:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 611 states have (on average 1.386252045826514) internal successors, (847), 612 states have internal predecessors, (847), 86 states have call successors, (86), 26 states have call predecessors, (86), 36 states have return successors, (109), 95 states have call predecessors, (109), 79 states have call successors, (109) [2022-07-19 10:53:34,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1042 transitions. [2022-07-19 10:53:34,347 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1042 transitions. Word has length 34 [2022-07-19 10:53:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:34,347 INFO L495 AbstractCegarLoop]: Abstraction has 734 states and 1042 transitions. [2022-07-19 10:53:34,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1042 transitions. [2022-07-19 10:53:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:53:34,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:34,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:34,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:53:34,349 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:34,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:34,350 INFO L85 PathProgramCache]: Analyzing trace with hash -298326112, now seen corresponding path program 1 times [2022-07-19 10:53:34,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:34,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863776662] [2022-07-19 10:53:34,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:34,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:34,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:34,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863776662] [2022-07-19 10:53:34,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863776662] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:34,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:34,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:34,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570418880] [2022-07-19 10:53:34,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:34,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:34,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:34,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:34,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:34,379 INFO L87 Difference]: Start difference. First operand 734 states and 1042 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:34,560 INFO L93 Difference]: Finished difference Result 762 states and 1073 transitions. [2022-07-19 10:53:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:53:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:53:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:34,563 INFO L225 Difference]: With dead ends: 762 [2022-07-19 10:53:34,563 INFO L226 Difference]: Without dead ends: 715 [2022-07-19 10:53:34,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:34,564 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 674 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:34,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1105 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:53:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-07-19 10:53:34,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 705. [2022-07-19 10:53:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-19 10:53:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-07-19 10:53:34,589 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 34 [2022-07-19 10:53:34,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:34,589 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-07-19 10:53:34,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,590 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-07-19 10:53:34,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:53:34,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:34,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:34,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:53:34,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:34,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:34,592 INFO L85 PathProgramCache]: Analyzing trace with hash 452395620, now seen corresponding path program 1 times [2022-07-19 10:53:34,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:34,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989295689] [2022-07-19 10:53:34,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:34,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:34,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:34,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989295689] [2022-07-19 10:53:34,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989295689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:34,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:34,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:34,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868074082] [2022-07-19 10:53:34,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:34,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:34,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:34,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:34,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:34,621 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:34,856 INFO L93 Difference]: Finished difference Result 806 states and 1144 transitions. [2022-07-19 10:53:34,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:53:34,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 10:53:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:34,859 INFO L225 Difference]: With dead ends: 806 [2022-07-19 10:53:34,859 INFO L226 Difference]: Without dead ends: 802 [2022-07-19 10:53:34,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:34,860 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 747 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:34,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1199 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-19 10:53:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 708. [2022-07-19 10:53:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 588 states have (on average 1.3911564625850341) internal successors, (818), 595 states have internal predecessors, (818), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-19 10:53:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1002 transitions. [2022-07-19 10:53:34,887 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1002 transitions. Word has length 35 [2022-07-19 10:53:34,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:34,888 INFO L495 AbstractCegarLoop]: Abstraction has 708 states and 1002 transitions. [2022-07-19 10:53:34,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1002 transitions. [2022-07-19 10:53:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:53:34,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:34,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:34,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:53:34,889 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:34,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash 452672450, now seen corresponding path program 1 times [2022-07-19 10:53:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:34,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062648263] [2022-07-19 10:53:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:34,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062648263] [2022-07-19 10:53:34,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062648263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:34,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:34,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:53:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100964956] [2022-07-19 10:53:34,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:34,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:53:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:34,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:53:34,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:34,916 INFO L87 Difference]: Start difference. First operand 708 states and 1002 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:34,978 INFO L93 Difference]: Finished difference Result 721 states and 1015 transitions. [2022-07-19 10:53:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:53:34,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 10:53:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:34,981 INFO L225 Difference]: With dead ends: 721 [2022-07-19 10:53:34,981 INFO L226 Difference]: Without dead ends: 691 [2022-07-19 10:53:34,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:34,981 INFO L413 NwaCegarLoop]: 651 mSDtfsCounter, 38 mSDsluCounter, 2556 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 3207 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:34,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 3207 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:53:34,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-19 10:53:35,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 691. [2022-07-19 10:53:35,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 571 states have (on average 1.3975481611208407) internal successors, (798), 578 states have internal predecessors, (798), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-19 10:53:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 982 transitions. [2022-07-19 10:53:35,016 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 982 transitions. Word has length 35 [2022-07-19 10:53:35,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:35,016 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 982 transitions. [2022-07-19 10:53:35,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:53:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 982 transitions. [2022-07-19 10:53:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:53:35,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:35,018 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:35,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:53:35,018 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:35,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1417116411, now seen corresponding path program 1 times [2022-07-19 10:53:35,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:35,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269603477] [2022-07-19 10:53:35,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:35,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:35,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 10:53:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:35,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269603477] [2022-07-19 10:53:35,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269603477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:35,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:35,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:53:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192670541] [2022-07-19 10:53:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:35,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:53:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:35,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:53:35,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:53:35,042 INFO L87 Difference]: Start difference. First operand 691 states and 982 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:35,232 INFO L93 Difference]: Finished difference Result 732 states and 1051 transitions. [2022-07-19 10:53:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-19 10:53:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:35,237 INFO L225 Difference]: With dead ends: 732 [2022-07-19 10:53:35,237 INFO L226 Difference]: Without dead ends: 725 [2022-07-19 10:53:35,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:35,238 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 153 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:35,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1553 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-07-19 10:53:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-07-19 10:53:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.393162393162393) internal successors, (815), 592 states have internal predecessors, (815), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-19 10:53:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 999 transitions. [2022-07-19 10:53:35,263 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 999 transitions. Word has length 37 [2022-07-19 10:53:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:35,263 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 999 transitions. [2022-07-19 10:53:35,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:35,263 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 999 transitions. [2022-07-19 10:53:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:53:35,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:35,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:35,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:53:35,265 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:35,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:35,265 INFO L85 PathProgramCache]: Analyzing trace with hash 607738208, now seen corresponding path program 1 times [2022-07-19 10:53:35,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:35,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422231268] [2022-07-19 10:53:35,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:35,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 10:53:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:35,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:35,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422231268] [2022-07-19 10:53:35,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422231268] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:35,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:35,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:53:35,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960611237] [2022-07-19 10:53:35,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:35,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:53:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:53:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:35,314 INFO L87 Difference]: Start difference. First operand 705 states and 999 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:35,682 INFO L93 Difference]: Finished difference Result 731 states and 1047 transitions. [2022-07-19 10:53:35,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:35,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-19 10:53:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:35,685 INFO L225 Difference]: With dead ends: 731 [2022-07-19 10:53:35,685 INFO L226 Difference]: Without dead ends: 725 [2022-07-19 10:53:35,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:35,686 INFO L413 NwaCegarLoop]: 622 mSDtfsCounter, 750 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 1884 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:35,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 1884 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:35,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2022-07-19 10:53:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 705. [2022-07-19 10:53:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 585 states have (on average 1.3914529914529914) internal successors, (814), 592 states have internal predecessors, (814), 86 states have call successors, (86), 26 states have call predecessors, (86), 33 states have return successors, (98), 86 states have call predecessors, (98), 79 states have call successors, (98) [2022-07-19 10:53:35,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 998 transitions. [2022-07-19 10:53:35,718 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 998 transitions. Word has length 39 [2022-07-19 10:53:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:35,718 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 998 transitions. [2022-07-19 10:53:35,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 998 transitions. [2022-07-19 10:53:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 10:53:35,720 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:35,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:35,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:53:35,720 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:35,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:35,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1973073460, now seen corresponding path program 1 times [2022-07-19 10:53:35,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:35,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257589603] [2022-07-19 10:53:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:35,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 10:53:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:35,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:35,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257589603] [2022-07-19 10:53:35,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257589603] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:35,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:35,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:35,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490010268] [2022-07-19 10:53:35,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:35,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:35,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:35,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:35,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:35,762 INFO L87 Difference]: Start difference. First operand 705 states and 998 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:36,080 INFO L93 Difference]: Finished difference Result 744 states and 1063 transitions. [2022-07-19 10:53:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-07-19 10:53:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:36,083 INFO L225 Difference]: With dead ends: 744 [2022-07-19 10:53:36,083 INFO L226 Difference]: Without dead ends: 712 [2022-07-19 10:53:36,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:36,084 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 158 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 3977 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:36,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 3977 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-19 10:53:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 696. [2022-07-19 10:53:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3737024221453287) internal successors, (794), 585 states have internal predecessors, (794), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-19 10:53:36,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 974 transitions. [2022-07-19 10:53:36,109 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 974 transitions. Word has length 40 [2022-07-19 10:53:36,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:36,110 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 974 transitions. [2022-07-19 10:53:36,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:36,110 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 974 transitions. [2022-07-19 10:53:36,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 10:53:36,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:36,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:36,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:53:36,112 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:36,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:36,112 INFO L85 PathProgramCache]: Analyzing trace with hash -577176493, now seen corresponding path program 1 times [2022-07-19 10:53:36,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:36,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700472426] [2022-07-19 10:53:36,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:36,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:36,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:36,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700472426] [2022-07-19 10:53:36,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700472426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:36,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:36,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:53:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739348137] [2022-07-19 10:53:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:36,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:36,137 INFO L87 Difference]: Start difference. First operand 696 states and 974 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:36,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:36,514 INFO L93 Difference]: Finished difference Result 777 states and 1087 transitions. [2022-07-19 10:53:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:53:36,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-07-19 10:53:36,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:36,517 INFO L225 Difference]: With dead ends: 777 [2022-07-19 10:53:36,517 INFO L226 Difference]: Without dead ends: 741 [2022-07-19 10:53:36,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:36,518 INFO L413 NwaCegarLoop]: 663 mSDtfsCounter, 792 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:36,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1517 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-19 10:53:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 696. [2022-07-19 10:53:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 578 states have (on average 1.3719723183391004) internal successors, (793), 585 states have internal predecessors, (793), 84 states have call successors, (84), 26 states have call predecessors, (84), 33 states have return successors, (96), 84 states have call predecessors, (96), 77 states have call successors, (96) [2022-07-19 10:53:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 973 transitions. [2022-07-19 10:53:36,545 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 973 transitions. Word has length 41 [2022-07-19 10:53:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:36,545 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 973 transitions. [2022-07-19 10:53:36,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 973 transitions. [2022-07-19 10:53:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:53:36,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:36,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:36,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:53:36,547 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:36,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:36,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1220210391, now seen corresponding path program 1 times [2022-07-19 10:53:36,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:36,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007689287] [2022-07-19 10:53:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:36,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 10:53:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:36,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:36,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007689287] [2022-07-19 10:53:36,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007689287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:36,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:36,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:53:36,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28226331] [2022-07-19 10:53:36,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:36,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:36,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:36,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:36,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:36,570 INFO L87 Difference]: Start difference. First operand 696 states and 973 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:36,864 INFO L93 Difference]: Finished difference Result 906 states and 1276 transitions. [2022-07-19 10:53:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:36,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-19 10:53:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:36,867 INFO L225 Difference]: With dead ends: 906 [2022-07-19 10:53:36,867 INFO L226 Difference]: Without dead ends: 688 [2022-07-19 10:53:36,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:36,868 INFO L413 NwaCegarLoop]: 605 mSDtfsCounter, 252 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1799 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:36,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1799 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:36,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2022-07-19 10:53:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 672. [2022-07-19 10:53:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 557 states have (on average 1.3698384201077198) internal successors, (763), 563 states have internal predecessors, (763), 83 states have call successors, (83), 26 states have call predecessors, (83), 31 states have return successors, (94), 82 states have call predecessors, (94), 77 states have call successors, (94) [2022-07-19 10:53:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 940 transitions. [2022-07-19 10:53:36,904 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 940 transitions. Word has length 43 [2022-07-19 10:53:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:36,904 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 940 transitions. [2022-07-19 10:53:36,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 940 transitions. [2022-07-19 10:53:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:53:36,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:36,905 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:36,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:53:36,906 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1828304678, now seen corresponding path program 1 times [2022-07-19 10:53:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667317252] [2022-07-19 10:53:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:36,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:53:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:36,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:37,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:37,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:37,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667317252] [2022-07-19 10:53:37,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667317252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:37,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:37,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:53:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048347006] [2022-07-19 10:53:37,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:37,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:53:37,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:37,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:53:37,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:37,004 INFO L87 Difference]: Start difference. First operand 672 states and 940 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:37,548 INFO L93 Difference]: Finished difference Result 702 states and 994 transitions. [2022-07-19 10:53:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:53:37,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-19 10:53:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:37,551 INFO L225 Difference]: With dead ends: 702 [2022-07-19 10:53:37,551 INFO L226 Difference]: Without dead ends: 686 [2022-07-19 10:53:37,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:37,552 INFO L413 NwaCegarLoop]: 611 mSDtfsCounter, 98 mSDsluCounter, 3850 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4461 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:37,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4461 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:37,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-07-19 10:53:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 670. [2022-07-19 10:53:37,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 556 states have (on average 1.368705035971223) internal successors, (761), 562 states have internal predecessors, (761), 82 states have call successors, (82), 26 states have call predecessors, (82), 31 states have return successors, (93), 81 states have call predecessors, (93), 76 states have call successors, (93) [2022-07-19 10:53:37,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 936 transitions. [2022-07-19 10:53:37,590 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 936 transitions. Word has length 43 [2022-07-19 10:53:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:37,590 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 936 transitions. [2022-07-19 10:53:37,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 936 transitions. [2022-07-19 10:53:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 10:53:37,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:37,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:37,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:53:37,592 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:37,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1534576112, now seen corresponding path program 1 times [2022-07-19 10:53:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:37,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816933382] [2022-07-19 10:53:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:37,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 10:53:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:37,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:37,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816933382] [2022-07-19 10:53:37,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816933382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:37,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:37,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 10:53:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364809557] [2022-07-19 10:53:37,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:37,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 10:53:37,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:37,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 10:53:37,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:37,690 INFO L87 Difference]: Start difference. First operand 670 states and 936 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:38,342 INFO L93 Difference]: Finished difference Result 722 states and 1014 transitions. [2022-07-19 10:53:38,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:53:38,343 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-07-19 10:53:38,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:38,345 INFO L225 Difference]: With dead ends: 722 [2022-07-19 10:53:38,345 INFO L226 Difference]: Without dead ends: 702 [2022-07-19 10:53:38,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:53:38,346 INFO L413 NwaCegarLoop]: 597 mSDtfsCounter, 247 mSDsluCounter, 4106 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:38,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 4703 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-19 10:53:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 668. [2022-07-19 10:53:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 555 states have (on average 1.3675675675675676) internal successors, (759), 561 states have internal predecessors, (759), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-07-19 10:53:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 932 transitions. [2022-07-19 10:53:38,377 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 932 transitions. Word has length 47 [2022-07-19 10:53:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:38,377 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 932 transitions. [2022-07-19 10:53:38,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 932 transitions. [2022-07-19 10:53:38,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:53:38,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:38,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:38,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:53:38,379 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:38,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 397890919, now seen corresponding path program 1 times [2022-07-19 10:53:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:38,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248130150] [2022-07-19 10:53:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:38,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:38,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:38,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:38,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248130150] [2022-07-19 10:53:38,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248130150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:38,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:38,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 10:53:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165269015] [2022-07-19 10:53:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:38,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 10:53:38,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:38,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 10:53:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:38,471 INFO L87 Difference]: Start difference. First operand 668 states and 932 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:39,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:39,189 INFO L93 Difference]: Finished difference Result 720 states and 1010 transitions. [2022-07-19 10:53:39,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:53:39,189 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-19 10:53:39,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:39,192 INFO L225 Difference]: With dead ends: 720 [2022-07-19 10:53:39,192 INFO L226 Difference]: Without dead ends: 699 [2022-07-19 10:53:39,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:53:39,193 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 168 mSDsluCounter, 4915 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 5496 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:39,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 5496 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:53:39,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-07-19 10:53:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 667. [2022-07-19 10:53:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 554 states have (on average 1.3501805054151625) internal successors, (748), 560 states have internal predecessors, (748), 81 states have call successors, (81), 26 states have call predecessors, (81), 31 states have return successors, (92), 80 states have call predecessors, (92), 75 states have call successors, (92) [2022-07-19 10:53:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 921 transitions. [2022-07-19 10:53:39,224 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 921 transitions. Word has length 44 [2022-07-19 10:53:39,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:39,224 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 921 transitions. [2022-07-19 10:53:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 921 transitions. [2022-07-19 10:53:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:53:39,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:39,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:39,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:53:39,227 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:39,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:39,228 INFO L85 PathProgramCache]: Analyzing trace with hash 117751789, now seen corresponding path program 1 times [2022-07-19 10:53:39,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:39,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725238982] [2022-07-19 10:53:39,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:39,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:53:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:39,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:39,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725238982] [2022-07-19 10:53:39,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725238982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:39,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:39,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:53:39,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612149823] [2022-07-19 10:53:39,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:39,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:53:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:39,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:53:39,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:39,325 INFO L87 Difference]: Start difference. First operand 667 states and 921 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:39,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:39,885 INFO L93 Difference]: Finished difference Result 696 states and 974 transitions. [2022-07-19 10:53:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:53:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2022-07-19 10:53:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:39,887 INFO L225 Difference]: With dead ends: 696 [2022-07-19 10:53:39,888 INFO L226 Difference]: Without dead ends: 680 [2022-07-19 10:53:39,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:39,889 INFO L413 NwaCegarLoop]: 589 mSDtfsCounter, 98 mSDsluCounter, 3693 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 4282 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:39,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 4282 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2022-07-19 10:53:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 664. [2022-07-19 10:53:39,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 552 states have (on average 1.3496376811594204) internal successors, (745), 558 states have internal predecessors, (745), 80 states have call successors, (80), 26 states have call predecessors, (80), 31 states have return successors, (91), 79 states have call predecessors, (91), 74 states have call successors, (91) [2022-07-19 10:53:39,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 916 transitions. [2022-07-19 10:53:39,914 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 916 transitions. Word has length 44 [2022-07-19 10:53:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:39,915 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 916 transitions. [2022-07-19 10:53:39,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:39,915 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 916 transitions. [2022-07-19 10:53:39,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:53:39,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:39,916 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:53:39,916 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:39,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:39,917 INFO L85 PathProgramCache]: Analyzing trace with hash -914670889, now seen corresponding path program 1 times [2022-07-19 10:53:39,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182558361] [2022-07-19 10:53:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:39,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 10:53:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:39,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182558361] [2022-07-19 10:53:39,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182558361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:39,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:39,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:53:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117211785] [2022-07-19 10:53:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:39,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:53:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:39,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:53:39,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:39,969 INFO L87 Difference]: Start difference. First operand 664 states and 916 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:40,303 INFO L93 Difference]: Finished difference Result 735 states and 1013 transitions. [2022-07-19 10:53:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:53:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-19 10:53:40,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:40,306 INFO L225 Difference]: With dead ends: 735 [2022-07-19 10:53:40,306 INFO L226 Difference]: Without dead ends: 668 [2022-07-19 10:53:40,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:53:40,307 INFO L413 NwaCegarLoop]: 585 mSDtfsCounter, 235 mSDsluCounter, 3099 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:40,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 3684 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-19 10:53:40,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 652. [2022-07-19 10:53:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 543 states have (on average 1.3443830570902393) internal successors, (730), 549 states have internal predecessors, (730), 77 states have call successors, (77), 26 states have call predecessors, (77), 31 states have return successors, (88), 76 states have call predecessors, (88), 71 states have call successors, (88) [2022-07-19 10:53:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 895 transitions. [2022-07-19 10:53:40,332 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 895 transitions. Word has length 44 [2022-07-19 10:53:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:40,332 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 895 transitions. [2022-07-19 10:53:40,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:40,333 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 895 transitions. [2022-07-19 10:53:40,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:53:40,334 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:40,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:40,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:53:40,334 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:40,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:40,335 INFO L85 PathProgramCache]: Analyzing trace with hash -501722536, now seen corresponding path program 1 times [2022-07-19 10:53:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:40,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108789484] [2022-07-19 10:53:40,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:40,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:40,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:40,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:40,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:40,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108789484] [2022-07-19 10:53:40,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108789484] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:40,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:40,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:53:40,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965245420] [2022-07-19 10:53:40,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:40,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:53:40,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:53:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:40,364 INFO L87 Difference]: Start difference. First operand 652 states and 895 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:40,710 INFO L93 Difference]: Finished difference Result 797 states and 1137 transitions. [2022-07-19 10:53:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:40,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-19 10:53:40,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:40,713 INFO L225 Difference]: With dead ends: 797 [2022-07-19 10:53:40,713 INFO L226 Difference]: Without dead ends: 703 [2022-07-19 10:53:40,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:40,714 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 130 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:40,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 2209 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:40,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2022-07-19 10:53:40,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 659. [2022-07-19 10:53:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 548 states have (on average 1.344890510948905) internal successors, (737), 555 states have internal predecessors, (737), 78 states have call successors, (78), 26 states have call predecessors, (78), 32 states have return successors, (95), 77 states have call predecessors, (95), 72 states have call successors, (95) [2022-07-19 10:53:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 910 transitions. [2022-07-19 10:53:40,741 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 910 transitions. Word has length 45 [2022-07-19 10:53:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:40,742 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 910 transitions. [2022-07-19 10:53:40,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 910 transitions. [2022-07-19 10:53:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:53:40,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:40,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:40,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:53:40,748 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1011195626, now seen corresponding path program 1 times [2022-07-19 10:53:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:40,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608595088] [2022-07-19 10:53:40,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:40,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:40,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:40,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608595088] [2022-07-19 10:53:40,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608595088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:40,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:40,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:53:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538154782] [2022-07-19 10:53:40,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:40,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:53:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:53:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:40,796 INFO L87 Difference]: Start difference. First operand 659 states and 910 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:41,128 INFO L93 Difference]: Finished difference Result 697 states and 978 transitions. [2022-07-19 10:53:41,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:53:41,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-07-19 10:53:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:41,131 INFO L225 Difference]: With dead ends: 697 [2022-07-19 10:53:41,131 INFO L226 Difference]: Without dead ends: 677 [2022-07-19 10:53:41,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:41,132 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 245 mSDsluCounter, 2872 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 3425 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:41,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 3425 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:41,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-07-19 10:53:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 657. [2022-07-19 10:53:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 547 states have (on average 1.3436928702010968) internal successors, (735), 554 states have internal predecessors, (735), 77 states have call successors, (77), 26 states have call predecessors, (77), 32 states have return successors, (94), 76 states have call predecessors, (94), 71 states have call successors, (94) [2022-07-19 10:53:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 906 transitions. [2022-07-19 10:53:41,156 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 906 transitions. Word has length 45 [2022-07-19 10:53:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:41,157 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 906 transitions. [2022-07-19 10:53:41,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 906 transitions. [2022-07-19 10:53:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-19 10:53:41,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:41,158 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:41,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:53:41,158 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1504244121, now seen corresponding path program 1 times [2022-07-19 10:53:41,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:41,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419629346] [2022-07-19 10:53:41,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:41,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:41,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419629346] [2022-07-19 10:53:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419629346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:41,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:41,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212108555] [2022-07-19 10:53:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:41,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:41,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:41,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:41,192 INFO L87 Difference]: Start difference. First operand 657 states and 906 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:41,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:41,438 INFO L93 Difference]: Finished difference Result 704 states and 988 transitions. [2022-07-19 10:53:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:41,438 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-19 10:53:41,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:41,440 INFO L225 Difference]: With dead ends: 704 [2022-07-19 10:53:41,440 INFO L226 Difference]: Without dead ends: 669 [2022-07-19 10:53:41,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:41,441 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 166 mSDsluCounter, 2979 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 3532 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:41,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 3532 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-07-19 10:53:41,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 649. [2022-07-19 10:53:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 541 states have (on average 1.3364140480591498) internal successors, (723), 548 states have internal predecessors, (723), 75 states have call successors, (75), 26 states have call predecessors, (75), 32 states have return successors, (92), 74 states have call predecessors, (92), 69 states have call successors, (92) [2022-07-19 10:53:41,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 890 transitions. [2022-07-19 10:53:41,465 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 890 transitions. Word has length 45 [2022-07-19 10:53:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:41,465 INFO L495 AbstractCegarLoop]: Abstraction has 649 states and 890 transitions. [2022-07-19 10:53:41,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:53:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 890 transitions. [2022-07-19 10:53:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:53:41,467 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:41,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:41,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:53:41,467 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -945301524, now seen corresponding path program 1 times [2022-07-19 10:53:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:41,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372620562] [2022-07-19 10:53:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:41,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:41,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372620562] [2022-07-19 10:53:41,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372620562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:41,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:41,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:53:41,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758544584] [2022-07-19 10:53:41,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:41,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:53:41,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:41,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:53:41,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:53:41,555 INFO L87 Difference]: Start difference. First operand 649 states and 890 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:42,140 INFO L93 Difference]: Finished difference Result 684 states and 955 transitions. [2022-07-19 10:53:42,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:53:42,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-07-19 10:53:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:42,143 INFO L225 Difference]: With dead ends: 684 [2022-07-19 10:53:42,143 INFO L226 Difference]: Without dead ends: 666 [2022-07-19 10:53:42,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:42,147 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 110 mSDsluCounter, 3773 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 4317 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:42,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 4317 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-07-19 10:53:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 646. [2022-07-19 10:53:42,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 539 states have (on average 1.3358070500927643) internal successors, (720), 546 states have internal predecessors, (720), 74 states have call successors, (74), 26 states have call predecessors, (74), 32 states have return successors, (91), 73 states have call predecessors, (91), 68 states have call successors, (91) [2022-07-19 10:53:42,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 885 transitions. [2022-07-19 10:53:42,173 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 885 transitions. Word has length 46 [2022-07-19 10:53:42,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:42,173 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 885 transitions. [2022-07-19 10:53:42,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:42,173 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 885 transitions. [2022-07-19 10:53:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-19 10:53:42,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:42,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:42,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:53:42,175 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1146484836, now seen corresponding path program 1 times [2022-07-19 10:53:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:42,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874975298] [2022-07-19 10:53:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:42,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:42,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 10:53:42,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:42,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:42,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:42,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874975298] [2022-07-19 10:53:42,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874975298] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:42,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:42,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:42,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197530508] [2022-07-19 10:53:42,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:42,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:42,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:42,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:42,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:42,238 INFO L87 Difference]: Start difference. First operand 646 states and 885 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:42,481 INFO L93 Difference]: Finished difference Result 703 states and 992 transitions. [2022-07-19 10:53:42,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 46 [2022-07-19 10:53:42,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:42,484 INFO L225 Difference]: With dead ends: 703 [2022-07-19 10:53:42,484 INFO L226 Difference]: Without dead ends: 676 [2022-07-19 10:53:42,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:42,485 INFO L413 NwaCegarLoop]: 532 mSDtfsCounter, 102 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:42,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 2648 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-07-19 10:53:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 650. [2022-07-19 10:53:42,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 541 states have (on average 1.33456561922366) internal successors, (722), 550 states have internal predecessors, (722), 74 states have call successors, (74), 26 states have call predecessors, (74), 34 states have return successors, (107), 73 states have call predecessors, (107), 68 states have call successors, (107) [2022-07-19 10:53:42,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 903 transitions. [2022-07-19 10:53:42,522 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 903 transitions. Word has length 46 [2022-07-19 10:53:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:42,523 INFO L495 AbstractCegarLoop]: Abstraction has 650 states and 903 transitions. [2022-07-19 10:53:42,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 903 transitions. [2022-07-19 10:53:42,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-19 10:53:42,527 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:42,527 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:42,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:53:42,527 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:42,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:42,528 INFO L85 PathProgramCache]: Analyzing trace with hash -876237255, now seen corresponding path program 1 times [2022-07-19 10:53:42,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:42,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138033952] [2022-07-19 10:53:42,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:42,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:42,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138033952] [2022-07-19 10:53:42,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138033952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:42,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:42,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 10:53:42,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835420672] [2022-07-19 10:53:42,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:42,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:53:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:42,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:53:42,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:42,633 INFO L87 Difference]: Start difference. First operand 650 states and 903 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:43,281 INFO L93 Difference]: Finished difference Result 685 states and 968 transitions. [2022-07-19 10:53:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:53:43,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 47 [2022-07-19 10:53:43,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:43,283 INFO L225 Difference]: With dead ends: 685 [2022-07-19 10:53:43,283 INFO L226 Difference]: Without dead ends: 667 [2022-07-19 10:53:43,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:53:43,284 INFO L413 NwaCegarLoop]: 538 mSDtfsCounter, 123 mSDsluCounter, 4152 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:43,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4690 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:53:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-07-19 10:53:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 647. [2022-07-19 10:53:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3339517625231911) internal successors, (719), 548 states have internal predecessors, (719), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (106), 72 states have call predecessors, (106), 67 states have call successors, (106) [2022-07-19 10:53:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 898 transitions. [2022-07-19 10:53:43,312 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 898 transitions. Word has length 47 [2022-07-19 10:53:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:43,313 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 898 transitions. [2022-07-19 10:53:43,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 898 transitions. [2022-07-19 10:53:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 10:53:43,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:43,314 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:43,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:53:43,315 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:43,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:43,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1600404883, now seen corresponding path program 1 times [2022-07-19 10:53:43,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:43,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641615759] [2022-07-19 10:53:43,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:43,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:53:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:53:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:53:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 10:53:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:43,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641615759] [2022-07-19 10:53:43,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641615759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:43,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:43,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:43,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731849334] [2022-07-19 10:53:43,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:43,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:43,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:43,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:43,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:43,374 INFO L87 Difference]: Start difference. First operand 647 states and 898 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:53:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:43,788 INFO L93 Difference]: Finished difference Result 1017 states and 1421 transitions. [2022-07-19 10:53:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:43,788 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 63 [2022-07-19 10:53:43,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:43,790 INFO L225 Difference]: With dead ends: 1017 [2022-07-19 10:53:43,790 INFO L226 Difference]: Without dead ends: 647 [2022-07-19 10:53:43,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:43,792 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 862 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1397 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:43,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1397 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:53:43,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-07-19 10:53:43,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-07-19 10:53:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 539 states have (on average 1.3265306122448979) internal successors, (715), 548 states have internal predecessors, (715), 73 states have call successors, (73), 26 states have call predecessors, (73), 34 states have return successors, (101), 72 states have call predecessors, (101), 67 states have call successors, (101) [2022-07-19 10:53:43,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 889 transitions. [2022-07-19 10:53:43,816 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 889 transitions. Word has length 63 [2022-07-19 10:53:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:43,816 INFO L495 AbstractCegarLoop]: Abstraction has 647 states and 889 transitions. [2022-07-19 10:53:43,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:53:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 889 transitions. [2022-07-19 10:53:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 10:53:43,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:43,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:43,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:53:43,819 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:43,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:43,819 INFO L85 PathProgramCache]: Analyzing trace with hash -816949344, now seen corresponding path program 1 times [2022-07-19 10:53:43,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:43,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935100806] [2022-07-19 10:53:43,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:43,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:53:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:53:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:53:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 10:53:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:43,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:43,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935100806] [2022-07-19 10:53:43,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935100806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:53:43,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73771013] [2022-07-19 10:53:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:53:43,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:53:43,867 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 10:53:43,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 10:53:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:44,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 10:53:44,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:53:44,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:44,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 10:53:44,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:44,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73771013] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 10:53:44,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 10:53:44,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 12 [2022-07-19 10:53:44,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111353149] [2022-07-19 10:53:44,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:44,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:44,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:44,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:44,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:44,307 INFO L87 Difference]: Start difference. First operand 647 states and 889 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:53:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:44,566 INFO L93 Difference]: Finished difference Result 935 states and 1273 transitions. [2022-07-19 10:53:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:44,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 64 [2022-07-19 10:53:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:44,569 INFO L225 Difference]: With dead ends: 935 [2022-07-19 10:53:44,569 INFO L226 Difference]: Without dead ends: 784 [2022-07-19 10:53:44,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:44,570 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 670 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:44,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1337 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:44,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-19 10:53:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 685. [2022-07-19 10:53:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 570 states have (on average 1.3263157894736841) internal successors, (756), 579 states have internal predecessors, (756), 76 states have call successors, (76), 28 states have call predecessors, (76), 38 states have return successors, (107), 77 states have call predecessors, (107), 70 states have call successors, (107) [2022-07-19 10:53:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 939 transitions. [2022-07-19 10:53:44,599 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 939 transitions. Word has length 64 [2022-07-19 10:53:44,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:44,600 INFO L495 AbstractCegarLoop]: Abstraction has 685 states and 939 transitions. [2022-07-19 10:53:44,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:53:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 939 transitions. [2022-07-19 10:53:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:53:44,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:44,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:44,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:53:44,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-19 10:53:44,818 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:44,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1640527845, now seen corresponding path program 1 times [2022-07-19 10:53:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:44,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953941906] [2022-07-19 10:53:44,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:44,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:44,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953941906] [2022-07-19 10:53:44,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953941906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:44,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:44,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 10:53:44,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985097688] [2022-07-19 10:53:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:44,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 10:53:44,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:44,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 10:53:44,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:44,930 INFO L87 Difference]: Start difference. First operand 685 states and 939 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:45,650 INFO L93 Difference]: Finished difference Result 703 states and 957 transitions. [2022-07-19 10:53:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:53:45,651 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-19 10:53:45,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:45,653 INFO L225 Difference]: With dead ends: 703 [2022-07-19 10:53:45,653 INFO L226 Difference]: Without dead ends: 683 [2022-07-19 10:53:45,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-19 10:53:45,654 INFO L413 NwaCegarLoop]: 499 mSDtfsCounter, 239 mSDsluCounter, 3755 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 1608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:45,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 4254 Invalid, 1608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:53:45,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-07-19 10:53:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2022-07-19 10:53:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 569 states have (on average 1.3251318101933216) internal successors, (754), 578 states have internal predecessors, (754), 75 states have call successors, (75), 28 states have call predecessors, (75), 38 states have return successors, (106), 76 states have call predecessors, (106), 69 states have call successors, (106) [2022-07-19 10:53:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 935 transitions. [2022-07-19 10:53:45,685 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 935 transitions. Word has length 48 [2022-07-19 10:53:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:45,685 INFO L495 AbstractCegarLoop]: Abstraction has 683 states and 935 transitions. [2022-07-19 10:53:45,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 10 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 935 transitions. [2022-07-19 10:53:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:53:45,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:45,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-19 10:53:45,687 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1335817887, now seen corresponding path program 1 times [2022-07-19 10:53:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:45,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110967376] [2022-07-19 10:53:45,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 10:53:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:45,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110967376] [2022-07-19 10:53:45,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110967376] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:45,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:45,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:53:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32237704] [2022-07-19 10:53:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:45,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:45,713 INFO L87 Difference]: Start difference. First operand 683 states and 935 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:45,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:45,924 INFO L93 Difference]: Finished difference Result 919 states and 1254 transitions. [2022-07-19 10:53:45,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:53:45,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 48 [2022-07-19 10:53:45,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:45,926 INFO L225 Difference]: With dead ends: 919 [2022-07-19 10:53:45,926 INFO L226 Difference]: Without dead ends: 641 [2022-07-19 10:53:45,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:45,927 INFO L413 NwaCegarLoop]: 496 mSDtfsCounter, 99 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:45,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1584 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-19 10:53:45,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 606. [2022-07-19 10:53:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 509 states have (on average 1.3143418467583496) internal successors, (669), 517 states have internal predecessors, (669), 65 states have call successors, (65), 25 states have call predecessors, (65), 31 states have return successors, (73), 63 states have call predecessors, (73), 59 states have call successors, (73) [2022-07-19 10:53:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 807 transitions. [2022-07-19 10:53:45,953 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 807 transitions. Word has length 48 [2022-07-19 10:53:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:45,953 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 807 transitions. [2022-07-19 10:53:45,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 807 transitions. [2022-07-19 10:53:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:53:45,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:45,955 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:45,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 10:53:45,955 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:45,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:45,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1170302788, now seen corresponding path program 1 times [2022-07-19 10:53:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:45,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577393653] [2022-07-19 10:53:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 10:53:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:46,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577393653] [2022-07-19 10:53:46,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577393653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:46,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:46,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 10:53:46,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063937487] [2022-07-19 10:53:46,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:46,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:53:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:46,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:53:46,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:46,076 INFO L87 Difference]: Start difference. First operand 606 states and 807 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:46,659 INFO L93 Difference]: Finished difference Result 621 states and 822 transitions. [2022-07-19 10:53:46,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:53:46,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-19 10:53:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:46,661 INFO L225 Difference]: With dead ends: 621 [2022-07-19 10:53:46,661 INFO L226 Difference]: Without dead ends: 597 [2022-07-19 10:53:46,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:53:46,662 INFO L413 NwaCegarLoop]: 501 mSDtfsCounter, 118 mSDsluCounter, 3884 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4385 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:46,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 4385 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:46,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-07-19 10:53:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-07-19 10:53:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 502 states have (on average 1.3147410358565736) internal successors, (660), 510 states have internal predecessors, (660), 63 states have call successors, (63), 25 states have call predecessors, (63), 31 states have return successors, (71), 61 states have call predecessors, (71), 57 states have call successors, (71) [2022-07-19 10:53:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 794 transitions. [2022-07-19 10:53:46,688 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 794 transitions. Word has length 54 [2022-07-19 10:53:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:46,689 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 794 transitions. [2022-07-19 10:53:46,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 794 transitions. [2022-07-19 10:53:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:53:46,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:46,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:46,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-19 10:53:46,690 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:46,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1066234985, now seen corresponding path program 1 times [2022-07-19 10:53:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120439398] [2022-07-19 10:53:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:46,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:53:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:46,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:46,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120439398] [2022-07-19 10:53:46,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120439398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:46,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:46,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 10:53:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730959308] [2022-07-19 10:53:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:46,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:53:46,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:46,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:53:46,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:46,809 INFO L87 Difference]: Start difference. First operand 597 states and 794 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:47,276 INFO L93 Difference]: Finished difference Result 612 states and 809 transitions. [2022-07-19 10:53:47,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:53:47,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-19 10:53:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:47,278 INFO L225 Difference]: With dead ends: 612 [2022-07-19 10:53:47,279 INFO L226 Difference]: Without dead ends: 594 [2022-07-19 10:53:47,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:53:47,279 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 118 mSDsluCounter, 3715 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:47,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 4191 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:53:47,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-19 10:53:47,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-07-19 10:53:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 500 states have (on average 1.314) internal successors, (657), 508 states have internal predecessors, (657), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-19 10:53:47,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 789 transitions. [2022-07-19 10:53:47,304 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 789 transitions. Word has length 48 [2022-07-19 10:53:47,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:47,305 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 789 transitions. [2022-07-19 10:53:47,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:47,305 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 789 transitions. [2022-07-19 10:53:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:53:47,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:47,306 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:47,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-19 10:53:47,306 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:47,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1131207190, now seen corresponding path program 1 times [2022-07-19 10:53:47,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:47,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385807748] [2022-07-19 10:53:47,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:47,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:53:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 10:53:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:47,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:47,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:47,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:47,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385807748] [2022-07-19 10:53:47,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385807748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:47,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:47,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:53:47,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493474388] [2022-07-19 10:53:47,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:47,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:53:47,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:47,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:53:47,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:47,398 INFO L87 Difference]: Start difference. First operand 594 states and 789 transitions. Second operand has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:48,059 INFO L93 Difference]: Finished difference Result 628 states and 824 transitions. [2022-07-19 10:53:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:53:48,059 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-07-19 10:53:48,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:48,061 INFO L225 Difference]: With dead ends: 628 [2022-07-19 10:53:48,061 INFO L226 Difference]: Without dead ends: 608 [2022-07-19 10:53:48,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:53:48,062 INFO L413 NwaCegarLoop]: 462 mSDtfsCounter, 256 mSDsluCounter, 3726 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:48,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 4188 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:53:48,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-07-19 10:53:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 592. [2022-07-19 10:53:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 499 states have (on average 1.312625250501002) internal successors, (655), 507 states have internal predecessors, (655), 61 states have call successors, (61), 25 states have call predecessors, (61), 31 states have return successors, (69), 59 states have call predecessors, (69), 55 states have call successors, (69) [2022-07-19 10:53:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 785 transitions. [2022-07-19 10:53:48,100 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 785 transitions. Word has length 51 [2022-07-19 10:53:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:48,100 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 785 transitions. [2022-07-19 10:53:48,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 10 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 785 transitions. [2022-07-19 10:53:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:53:48,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:48,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:48,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-19 10:53:48,102 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -480998912, now seen corresponding path program 1 times [2022-07-19 10:53:48,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:48,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351682193] [2022-07-19 10:53:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:53:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 10:53:48,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:48,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351682193] [2022-07-19 10:53:48,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351682193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:48,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:48,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:48,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601214832] [2022-07-19 10:53:48,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:48,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:48,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:48,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:48,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:48,137 INFO L87 Difference]: Start difference. First operand 592 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:48,423 INFO L93 Difference]: Finished difference Result 674 states and 879 transitions. [2022-07-19 10:53:48,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:48,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-07-19 10:53:48,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:48,425 INFO L225 Difference]: With dead ends: 674 [2022-07-19 10:53:48,425 INFO L226 Difference]: Without dead ends: 648 [2022-07-19 10:53:48,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:48,426 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 267 mSDsluCounter, 1830 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:48,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 2340 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-07-19 10:53:48,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 598. [2022-07-19 10:53:48,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 504 states have (on average 1.3115079365079365) internal successors, (661), 512 states have internal predecessors, (661), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-19 10:53:48,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 793 transitions. [2022-07-19 10:53:48,451 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 793 transitions. Word has length 50 [2022-07-19 10:53:48,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:48,451 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 793 transitions. [2022-07-19 10:53:48,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:48,452 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 793 transitions. [2022-07-19 10:53:48,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:53:48,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:48,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-19 10:53:48,453 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:48,453 INFO L85 PathProgramCache]: Analyzing trace with hash 266979750, now seen corresponding path program 1 times [2022-07-19 10:53:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:48,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935506890] [2022-07-19 10:53:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:53:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:53:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:53:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 10:53:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935506890] [2022-07-19 10:53:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935506890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:48,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:48,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:53:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430026284] [2022-07-19 10:53:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:48,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:53:48,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:48,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:53:48,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:48,494 INFO L87 Difference]: Start difference. First operand 598 states and 793 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:53:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:48,817 INFO L93 Difference]: Finished difference Result 703 states and 934 transitions. [2022-07-19 10:53:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:53:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2022-07-19 10:53:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:48,822 INFO L225 Difference]: With dead ends: 703 [2022-07-19 10:53:48,822 INFO L226 Difference]: Without dead ends: 598 [2022-07-19 10:53:48,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:48,823 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 113 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1415 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:48,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1415 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-07-19 10:53:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-07-19 10:53:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 504 states have (on average 1.3055555555555556) internal successors, (658), 512 states have internal predecessors, (658), 62 states have call successors, (62), 25 states have call predecessors, (62), 31 states have return successors, (70), 60 states have call predecessors, (70), 56 states have call successors, (70) [2022-07-19 10:53:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 790 transitions. [2022-07-19 10:53:48,849 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 790 transitions. Word has length 53 [2022-07-19 10:53:48,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:48,849 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 790 transitions. [2022-07-19 10:53:48,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:53:48,849 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 790 transitions. [2022-07-19 10:53:48,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:53:48,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:48,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:48,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-19 10:53:48,850 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1095084481, now seen corresponding path program 1 times [2022-07-19 10:53:48,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:48,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520327139] [2022-07-19 10:53:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:48,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:48,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:48,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520327139] [2022-07-19 10:53:48,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520327139] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:48,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:48,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:53:48,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449670808] [2022-07-19 10:53:48,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:48,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:53:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:53:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:48,953 INFO L87 Difference]: Start difference. First operand 598 states and 790 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:49,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:49,531 INFO L93 Difference]: Finished difference Result 616 states and 808 transitions. [2022-07-19 10:53:49,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:53:49,531 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-07-19 10:53:49,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:49,533 INFO L225 Difference]: With dead ends: 616 [2022-07-19 10:53:49,533 INFO L226 Difference]: Without dead ends: 596 [2022-07-19 10:53:49,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:53:49,533 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 256 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 3892 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:49,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 3892 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-19 10:53:49,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2022-07-19 10:53:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 503 states have (on average 1.3041749502982107) internal successors, (656), 511 states have internal predecessors, (656), 61 states have call successors, (61), 25 states have call predecessors, (61), 31 states have return successors, (69), 59 states have call predecessors, (69), 55 states have call successors, (69) [2022-07-19 10:53:49,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 786 transitions. [2022-07-19 10:53:49,558 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 786 transitions. Word has length 52 [2022-07-19 10:53:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:49,559 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 786 transitions. [2022-07-19 10:53:49,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:49,559 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 786 transitions. [2022-07-19 10:53:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:53:49,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:49,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:49,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-19 10:53:49,560 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:49,561 INFO L85 PathProgramCache]: Analyzing trace with hash 309046761, now seen corresponding path program 1 times [2022-07-19 10:53:49,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:49,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566865201] [2022-07-19 10:53:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:49,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 10:53:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 10:53:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:49,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:49,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566865201] [2022-07-19 10:53:49,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566865201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:49,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:49,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:53:49,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959304690] [2022-07-19 10:53:49,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:49,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:53:49,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:49,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:53:49,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:53:49,616 INFO L87 Difference]: Start difference. First operand 596 states and 786 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:49,960 INFO L93 Difference]: Finished difference Result 630 states and 826 transitions. [2022-07-19 10:53:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:53:49,960 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-19 10:53:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:49,961 INFO L225 Difference]: With dead ends: 630 [2022-07-19 10:53:49,962 INFO L226 Difference]: Without dead ends: 576 [2022-07-19 10:53:49,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:49,962 INFO L413 NwaCegarLoop]: 469 mSDtfsCounter, 266 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:49,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 2742 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-07-19 10:53:49,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 569. [2022-07-19 10:53:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 481 states have (on average 1.288981288981289) internal successors, (620), 489 states have internal predecessors, (620), 56 states have call successors, (56), 25 states have call predecessors, (56), 31 states have return successors, (63), 54 states have call predecessors, (63), 50 states have call successors, (63) [2022-07-19 10:53:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 739 transitions. [2022-07-19 10:53:49,992 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 739 transitions. Word has length 51 [2022-07-19 10:53:49,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:49,993 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 739 transitions. [2022-07-19 10:53:49,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 7 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 739 transitions. [2022-07-19 10:53:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 10:53:49,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:49,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:49,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-19 10:53:49,994 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1614181273, now seen corresponding path program 1 times [2022-07-19 10:53:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:49,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722154279] [2022-07-19 10:53:49,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 10:53:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 10:53:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,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-07-19 10:53:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:50,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722154279] [2022-07-19 10:53:50,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722154279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:50,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:50,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:50,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523119775] [2022-07-19 10:53:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:50,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:50,040 INFO L87 Difference]: Start difference. First operand 569 states and 739 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:50,290 INFO L93 Difference]: Finished difference Result 610 states and 781 transitions. [2022-07-19 10:53:50,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:50,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-19 10:53:50,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:50,292 INFO L225 Difference]: With dead ends: 610 [2022-07-19 10:53:50,292 INFO L226 Difference]: Without dead ends: 563 [2022-07-19 10:53:50,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:50,293 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 179 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:50,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1718 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:50,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-19 10:53:50,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 559. [2022-07-19 10:53:50,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 473 states have (on average 1.285412262156448) internal successors, (608), 481 states have internal predecessors, (608), 54 states have call successors, (54), 25 states have call predecessors, (54), 31 states have return successors, (61), 52 states have call predecessors, (61), 48 states have call successors, (61) [2022-07-19 10:53:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 723 transitions. [2022-07-19 10:53:50,317 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 723 transitions. Word has length 51 [2022-07-19 10:53:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:50,317 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 723 transitions. [2022-07-19 10:53:50,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 723 transitions. [2022-07-19 10:53:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:53:50,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:50,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:50,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-19 10:53:50,319 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:50,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1624287433, now seen corresponding path program 1 times [2022-07-19 10:53:50,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:50,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825413436] [2022-07-19 10:53:50,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:50,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:50,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 10:53:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:50,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:50,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825413436] [2022-07-19 10:53:50,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825413436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:50,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:50,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:50,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286640027] [2022-07-19 10:53:50,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:50,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:50,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:50,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:50,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:50,352 INFO L87 Difference]: Start difference. First operand 559 states and 723 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:50,608 INFO L93 Difference]: Finished difference Result 586 states and 751 transitions. [2022-07-19 10:53:50,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:50,609 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2022-07-19 10:53:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:50,610 INFO L225 Difference]: With dead ends: 586 [2022-07-19 10:53:50,610 INFO L226 Difference]: Without dead ends: 554 [2022-07-19 10:53:50,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:50,611 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 96 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:50,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1966 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:50,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-07-19 10:53:50,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2022-07-19 10:53:50,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 469 states have (on average 1.2857142857142858) internal successors, (603), 477 states have internal predecessors, (603), 53 states have call successors, (53), 25 states have call predecessors, (53), 31 states have return successors, (60), 51 states have call predecessors, (60), 47 states have call successors, (60) [2022-07-19 10:53:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 716 transitions. [2022-07-19 10:53:50,634 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 716 transitions. Word has length 52 [2022-07-19 10:53:50,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:50,634 INFO L495 AbstractCegarLoop]: Abstraction has 554 states and 716 transitions. [2022-07-19 10:53:50,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 716 transitions. [2022-07-19 10:53:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-19 10:53:50,636 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:50,636 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:50,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-19 10:53:50,636 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:50,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:50,636 INFO L85 PathProgramCache]: Analyzing trace with hash 576638373, now seen corresponding path program 1 times [2022-07-19 10:53:50,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:50,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568607964] [2022-07-19 10:53:50,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:50,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:50,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:50,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568607964] [2022-07-19 10:53:50,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568607964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:50,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:50,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:53:50,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810514539] [2022-07-19 10:53:50,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:50,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:50,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:50,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:50,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:50,665 INFO L87 Difference]: Start difference. First operand 554 states and 716 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:50,971 INFO L93 Difference]: Finished difference Result 653 states and 844 transitions. [2022-07-19 10:53:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:50,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2022-07-19 10:53:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:50,973 INFO L225 Difference]: With dead ends: 653 [2022-07-19 10:53:50,973 INFO L226 Difference]: Without dead ends: 641 [2022-07-19 10:53:50,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:50,974 INFO L413 NwaCegarLoop]: 425 mSDtfsCounter, 216 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:50,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1233 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:50,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2022-07-19 10:53:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 586. [2022-07-19 10:53:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 499 states have (on average 1.280561122244489) internal successors, (639), 507 states have internal predecessors, (639), 53 states have call successors, (53), 25 states have call predecessors, (53), 33 states have return successors, (62), 53 states have call predecessors, (62), 47 states have call successors, (62) [2022-07-19 10:53:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 754 transitions. [2022-07-19 10:53:51,000 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 754 transitions. Word has length 52 [2022-07-19 10:53:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:51,000 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 754 transitions. [2022-07-19 10:53:51,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 754 transitions. [2022-07-19 10:53:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 10:53:51,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:51,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:51,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-19 10:53:51,002 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2037022253, now seen corresponding path program 1 times [2022-07-19 10:53:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:51,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486933262] [2022-07-19 10:53:51,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:51,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 10:53:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:53:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 10:53:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 10:53:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:51,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:51,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486933262] [2022-07-19 10:53:51,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486933262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:51,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:51,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:53:51,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514611480] [2022-07-19 10:53:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:51,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:53:51,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:51,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:53:51,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:53:51,043 INFO L87 Difference]: Start difference. First operand 586 states and 754 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:53:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:51,354 INFO L93 Difference]: Finished difference Result 716 states and 919 transitions. [2022-07-19 10:53:51,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:53:51,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2022-07-19 10:53:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:51,358 INFO L225 Difference]: With dead ends: 716 [2022-07-19 10:53:51,358 INFO L226 Difference]: Without dead ends: 643 [2022-07-19 10:53:51,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:51,361 INFO L413 NwaCegarLoop]: 463 mSDtfsCounter, 417 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:51,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 1341 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2022-07-19 10:53:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 626. [2022-07-19 10:53:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 533 states have (on average 1.2870544090056286) internal successors, (686), 540 states have internal predecessors, (686), 55 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (67), 57 states have call predecessors, (67), 50 states have call successors, (67) [2022-07-19 10:53:51,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 808 transitions. [2022-07-19 10:53:51,395 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 808 transitions. Word has length 56 [2022-07-19 10:53:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:51,395 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 808 transitions. [2022-07-19 10:53:51,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:53:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 808 transitions. [2022-07-19 10:53:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-19 10:53:51,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:51,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:51,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-19 10:53:51,397 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:51,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1140697567, now seen corresponding path program 1 times [2022-07-19 10:53:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:51,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837706071] [2022-07-19 10:53:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:51,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837706071] [2022-07-19 10:53:51,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837706071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:51,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:51,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:51,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668999258] [2022-07-19 10:53:51,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:51,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:51,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:51,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:51,498 INFO L87 Difference]: Start difference. First operand 626 states and 808 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:51,935 INFO L93 Difference]: Finished difference Result 687 states and 887 transitions. [2022-07-19 10:53:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:53:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-19 10:53:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:51,937 INFO L225 Difference]: With dead ends: 687 [2022-07-19 10:53:51,937 INFO L226 Difference]: Without dead ends: 678 [2022-07-19 10:53:51,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:53:51,938 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 747 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1443 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:51,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1443 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:53:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-07-19 10:53:51,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 626. [2022-07-19 10:53:51,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 533 states have (on average 1.2833020637898687) internal successors, (684), 540 states have internal predecessors, (684), 55 states have call successors, (55), 28 states have call predecessors, (55), 37 states have return successors, (67), 57 states have call predecessors, (67), 50 states have call successors, (67) [2022-07-19 10:53:51,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 806 transitions. [2022-07-19 10:53:51,968 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 806 transitions. Word has length 53 [2022-07-19 10:53:51,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:51,969 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 806 transitions. [2022-07-19 10:53:51,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 806 transitions. [2022-07-19 10:53:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-19 10:53:51,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:51,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:51,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-19 10:53:51,970 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:51,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:51,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1949554969, now seen corresponding path program 1 times [2022-07-19 10:53:51,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:51,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377539769] [2022-07-19 10:53:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:53:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 10:53:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 10:53:52,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:52,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377539769] [2022-07-19 10:53:52,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377539769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:52,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:52,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:53:52,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877949333] [2022-07-19 10:53:52,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:52,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:53:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:53:52,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:52,078 INFO L87 Difference]: Start difference. First operand 626 states and 806 transitions. Second operand has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:53:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:52,723 INFO L93 Difference]: Finished difference Result 669 states and 855 transitions. [2022-07-19 10:53:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:53:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 59 [2022-07-19 10:53:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:52,725 INFO L225 Difference]: With dead ends: 669 [2022-07-19 10:53:52,725 INFO L226 Difference]: Without dead ends: 649 [2022-07-19 10:53:52,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:53:52,730 INFO L413 NwaCegarLoop]: 428 mSDtfsCounter, 243 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 4002 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:52,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 4002 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-07-19 10:53:52,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 624. [2022-07-19 10:53:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 532 states have (on average 1.281954887218045) internal successors, (682), 539 states have internal predecessors, (682), 54 states have call successors, (54), 28 states have call predecessors, (54), 37 states have return successors, (66), 56 states have call predecessors, (66), 49 states have call successors, (66) [2022-07-19 10:53:52,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 802 transitions. [2022-07-19 10:53:52,781 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 802 transitions. Word has length 59 [2022-07-19 10:53:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:52,781 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 802 transitions. [2022-07-19 10:53:52,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:53:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 802 transitions. [2022-07-19 10:53:52,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-19 10:53:52,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:52,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:52,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-19 10:53:52,783 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:52,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:52,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1478759627, now seen corresponding path program 1 times [2022-07-19 10:53:52,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:52,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015255072] [2022-07-19 10:53:52,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:52,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 10:53:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:52,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:52,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:52,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015255072] [2022-07-19 10:53:52,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015255072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:52,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:52,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 10:53:52,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530278152] [2022-07-19 10:53:52,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:52,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:53:52,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:52,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:53:52,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:53:52,928 INFO L87 Difference]: Start difference. First operand 624 states and 802 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:53,772 INFO L93 Difference]: Finished difference Result 644 states and 823 transitions. [2022-07-19 10:53:53,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 10:53:53,772 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-07-19 10:53:53,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:53,773 INFO L225 Difference]: With dead ends: 644 [2022-07-19 10:53:53,774 INFO L226 Difference]: Without dead ends: 620 [2022-07-19 10:53:53,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2022-07-19 10:53:53,774 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 232 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:53,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 4358 Invalid, 1883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-19 10:53:53,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2022-07-19 10:53:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2022-07-19 10:53:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 529 states have (on average 1.281663516068053) internal successors, (678), 536 states have internal predecessors, (678), 53 states have call successors, (53), 28 states have call predecessors, (53), 37 states have return successors, (65), 55 states have call predecessors, (65), 48 states have call successors, (65) [2022-07-19 10:53:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 796 transitions. [2022-07-19 10:53:53,810 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 796 transitions. Word has length 55 [2022-07-19 10:53:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:53,810 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 796 transitions. [2022-07-19 10:53:53,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 796 transitions. [2022-07-19 10:53:53,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:53:53,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:53,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:53,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-19 10:53:53,813 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1059320829, now seen corresponding path program 1 times [2022-07-19 10:53:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:53,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290895820] [2022-07-19 10:53:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:53,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 10:53:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:53:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:53,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:53,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290895820] [2022-07-19 10:53:53,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290895820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:53,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:53,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494683964] [2022-07-19 10:53:53,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:53,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:53,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:53,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:53,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:53,868 INFO L87 Difference]: Start difference. First operand 620 states and 796 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:54,092 INFO L93 Difference]: Finished difference Result 647 states and 824 transitions. [2022-07-19 10:53:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-19 10:53:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:54,094 INFO L225 Difference]: With dead ends: 647 [2022-07-19 10:53:54,094 INFO L226 Difference]: Without dead ends: 615 [2022-07-19 10:53:54,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:54,095 INFO L413 NwaCegarLoop]: 394 mSDtfsCounter, 171 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:54,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1642 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-19 10:53:54,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2022-07-19 10:53:54,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 525 states have (on average 1.2819047619047619) internal successors, (673), 532 states have internal predecessors, (673), 52 states have call successors, (52), 28 states have call predecessors, (52), 37 states have return successors, (64), 54 states have call predecessors, (64), 47 states have call successors, (64) [2022-07-19 10:53:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 789 transitions. [2022-07-19 10:53:54,125 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 789 transitions. Word has length 54 [2022-07-19 10:53:54,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:54,126 INFO L495 AbstractCegarLoop]: Abstraction has 615 states and 789 transitions. [2022-07-19 10:53:54,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 789 transitions. [2022-07-19 10:53:54,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:53:54,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:54,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:54,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-19 10:53:54,127 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:54,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1513227889, now seen corresponding path program 1 times [2022-07-19 10:53:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:54,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397451976] [2022-07-19 10:53:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 10:53:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:53:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:54,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:54,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397451976] [2022-07-19 10:53:54,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397451976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:54,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:54,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:53:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013111379] [2022-07-19 10:53:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:54,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:53:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:53:54,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:53:54,192 INFO L87 Difference]: Start difference. First operand 615 states and 789 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:54,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:54,537 INFO L93 Difference]: Finished difference Result 638 states and 814 transitions. [2022-07-19 10:53:54,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:53:54,537 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-19 10:53:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:54,538 INFO L225 Difference]: With dead ends: 638 [2022-07-19 10:53:54,538 INFO L226 Difference]: Without dead ends: 612 [2022-07-19 10:53:54,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:53:54,539 INFO L413 NwaCegarLoop]: 403 mSDtfsCounter, 232 mSDsluCounter, 2610 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:54,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 3013 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:54,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2022-07-19 10:53:54,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2022-07-19 10:53:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 523 states have (on average 1.2810707456978967) internal successors, (670), 530 states have internal predecessors, (670), 51 states have call successors, (51), 28 states have call predecessors, (51), 37 states have return successors, (63), 53 states have call predecessors, (63), 46 states have call successors, (63) [2022-07-19 10:53:54,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 784 transitions. [2022-07-19 10:53:54,567 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 784 transitions. Word has length 54 [2022-07-19 10:53:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:54,567 INFO L495 AbstractCegarLoop]: Abstraction has 612 states and 784 transitions. [2022-07-19 10:53:54,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 784 transitions. [2022-07-19 10:53:54,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:53:54,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:54,568 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:54,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-19 10:53:54,569 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash 362195338, now seen corresponding path program 1 times [2022-07-19 10:53:54,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:54,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808430684] [2022-07-19 10:53:54,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:54,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:54,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:54,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:54,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808430684] [2022-07-19 10:53:54,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808430684] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:54,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:54,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:53:54,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549279092] [2022-07-19 10:53:54,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:54,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:53:54,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:54,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:53:54,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:54,616 INFO L87 Difference]: Start difference. First operand 612 states and 784 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:55,102 INFO L93 Difference]: Finished difference Result 668 states and 856 transitions. [2022-07-19 10:53:55,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:53:55,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-19 10:53:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:55,103 INFO L225 Difference]: With dead ends: 668 [2022-07-19 10:53:55,103 INFO L226 Difference]: Without dead ends: 664 [2022-07-19 10:53:55,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:55,104 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 735 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:55,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1322 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:53:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-07-19 10:53:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 609. [2022-07-19 10:53:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 520 states have (on average 1.2788461538461537) internal successors, (665), 527 states have internal predecessors, (665), 51 states have call successors, (51), 28 states have call predecessors, (51), 37 states have return successors, (63), 53 states have call predecessors, (63), 46 states have call successors, (63) [2022-07-19 10:53:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 779 transitions. [2022-07-19 10:53:55,134 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 779 transitions. Word has length 54 [2022-07-19 10:53:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:55,134 INFO L495 AbstractCegarLoop]: Abstraction has 609 states and 779 transitions. [2022-07-19 10:53:55,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:53:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 779 transitions. [2022-07-19 10:53:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:53:55,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:55,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:55,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-19 10:53:55,135 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:55,136 INFO L85 PathProgramCache]: Analyzing trace with hash 362472168, now seen corresponding path program 1 times [2022-07-19 10:53:55,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:55,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842625594] [2022-07-19 10:53:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:55,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:55,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:55,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:55,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842625594] [2022-07-19 10:53:55,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842625594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:55,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:55,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:53:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923734850] [2022-07-19 10:53:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:55,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:53:55,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:53:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:53:55,233 INFO L87 Difference]: Start difference. First operand 609 states and 779 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:55,753 INFO L93 Difference]: Finished difference Result 619 states and 788 transitions. [2022-07-19 10:53:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:53:55,754 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-19 10:53:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:55,755 INFO L225 Difference]: With dead ends: 619 [2022-07-19 10:53:55,755 INFO L226 Difference]: Without dead ends: 591 [2022-07-19 10:53:55,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:53:55,756 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 287 mSDsluCounter, 2154 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 2526 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:55,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 2526 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:53:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-07-19 10:53:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 587. [2022-07-19 10:53:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 499 states have (on average 1.2725450901803608) internal successors, (635), 506 states have internal predecessors, (635), 51 states have call successors, (51), 28 states have call predecessors, (51), 36 states have return successors, (62), 52 states have call predecessors, (62), 46 states have call successors, (62) [2022-07-19 10:53:55,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 748 transitions. [2022-07-19 10:53:55,785 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 748 transitions. Word has length 54 [2022-07-19 10:53:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:55,785 INFO L495 AbstractCegarLoop]: Abstraction has 587 states and 748 transitions. [2022-07-19 10:53:55,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:55,786 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 748 transitions. [2022-07-19 10:53:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:53:55,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:55,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:55,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-19 10:53:55,787 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:55,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:55,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1415863677, now seen corresponding path program 1 times [2022-07-19 10:53:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:55,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979533989] [2022-07-19 10:53:55,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:55,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:55,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:55,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979533989] [2022-07-19 10:53:55,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979533989] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:55,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:55,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:53:55,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670725928] [2022-07-19 10:53:55,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:55,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:53:55,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:55,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:53:55,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:53:55,817 INFO L87 Difference]: Start difference. First operand 587 states and 748 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:56,041 INFO L93 Difference]: Finished difference Result 613 states and 778 transitions. [2022-07-19 10:53:56,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:53:56,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2022-07-19 10:53:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:56,043 INFO L225 Difference]: With dead ends: 613 [2022-07-19 10:53:56,043 INFO L226 Difference]: Without dead ends: 580 [2022-07-19 10:53:56,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:53:56,043 INFO L413 NwaCegarLoop]: 412 mSDtfsCounter, 232 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:56,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 951 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-07-19 10:53:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 576. [2022-07-19 10:53:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 489 states have (on average 1.2638036809815951) internal successors, (618), 496 states have internal predecessors, (618), 51 states have call successors, (51), 28 states have call predecessors, (51), 35 states have return successors, (61), 51 states have call predecessors, (61), 46 states have call successors, (61) [2022-07-19 10:53:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 730 transitions. [2022-07-19 10:53:56,093 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 730 transitions. Word has length 54 [2022-07-19 10:53:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:56,093 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 730 transitions. [2022-07-19 10:53:56,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 730 transitions. [2022-07-19 10:53:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 10:53:56,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:56,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:56,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-19 10:53:56,095 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash -275547021, now seen corresponding path program 1 times [2022-07-19 10:53:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:56,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859486758] [2022-07-19 10:53:56,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:53:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:56,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:56,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859486758] [2022-07-19 10:53:56,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859486758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:56,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:56,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150725816] [2022-07-19 10:53:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:56,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:56,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:56,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:56,141 INFO L87 Difference]: Start difference. First operand 576 states and 730 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:53:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:56,478 INFO L93 Difference]: Finished difference Result 625 states and 782 transitions. [2022-07-19 10:53:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:56,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-07-19 10:53:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:56,480 INFO L225 Difference]: With dead ends: 625 [2022-07-19 10:53:56,480 INFO L226 Difference]: Without dead ends: 594 [2022-07-19 10:53:56,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:56,481 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 282 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:56,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1506 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-19 10:53:56,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 576. [2022-07-19 10:53:56,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 489 states have (on average 1.261758691206544) internal successors, (617), 496 states have internal predecessors, (617), 51 states have call successors, (51), 28 states have call predecessors, (51), 35 states have return successors, (61), 51 states have call predecessors, (61), 46 states have call successors, (61) [2022-07-19 10:53:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 729 transitions. [2022-07-19 10:53:56,512 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 729 transitions. Word has length 56 [2022-07-19 10:53:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:56,512 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 729 transitions. [2022-07-19 10:53:56,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:53:56,513 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 729 transitions. [2022-07-19 10:53:56,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 10:53:56,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:56,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:56,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-07-19 10:53:56,514 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash -252914767, now seen corresponding path program 1 times [2022-07-19 10:53:56,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:56,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186990636] [2022-07-19 10:53:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:56,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:56,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:53:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:56,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:56,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186990636] [2022-07-19 10:53:56,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186990636] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:56,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:56,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:53:56,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26778612] [2022-07-19 10:53:56,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:56,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:53:56,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:56,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:53:56,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:56,607 INFO L87 Difference]: Start difference. First operand 576 states and 729 transitions. Second operand has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:57,238 INFO L93 Difference]: Finished difference Result 619 states and 778 transitions. [2022-07-19 10:53:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:53:57,238 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56 [2022-07-19 10:53:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:57,239 INFO L225 Difference]: With dead ends: 619 [2022-07-19 10:53:57,239 INFO L226 Difference]: Without dead ends: 589 [2022-07-19 10:53:57,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:53:57,240 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 260 mSDsluCounter, 2991 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:57,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 3382 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:57,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-07-19 10:53:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 571. [2022-07-19 10:53:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 485 states have (on average 1.2577319587628866) internal successors, (610), 492 states have internal predecessors, (610), 50 states have call successors, (50), 28 states have call predecessors, (50), 35 states have return successors, (59), 50 states have call predecessors, (59), 45 states have call successors, (59) [2022-07-19 10:53:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 719 transitions. [2022-07-19 10:53:57,268 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 719 transitions. Word has length 56 [2022-07-19 10:53:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:57,268 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 719 transitions. [2022-07-19 10:53:57,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.769230769230769) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:53:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 719 transitions. [2022-07-19 10:53:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 10:53:57,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:57,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:57,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-19 10:53:57,270 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1867013461, now seen corresponding path program 1 times [2022-07-19 10:53:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760684265] [2022-07-19 10:53:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-19 10:53:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:57,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:57,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760684265] [2022-07-19 10:53:57,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760684265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:57,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:57,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:57,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997169401] [2022-07-19 10:53:57,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:57,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:57,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:57,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:57,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:57,319 INFO L87 Difference]: Start difference. First operand 571 states and 719 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:53:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:57,642 INFO L93 Difference]: Finished difference Result 602 states and 751 transitions. [2022-07-19 10:53:57,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:57,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2022-07-19 10:53:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:57,643 INFO L225 Difference]: With dead ends: 602 [2022-07-19 10:53:57,643 INFO L226 Difference]: Without dead ends: 565 [2022-07-19 10:53:57,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:57,644 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 170 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:57,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1807 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-19 10:53:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-07-19 10:53:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 480 states have (on average 1.2583333333333333) internal successors, (604), 487 states have internal predecessors, (604), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-19 10:53:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 711 transitions. [2022-07-19 10:53:57,699 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 711 transitions. Word has length 56 [2022-07-19 10:53:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:57,699 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 711 transitions. [2022-07-19 10:53:57,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:53:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 711 transitions. [2022-07-19 10:53:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-19 10:53:57,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:57,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:57,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-19 10:53:57,704 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:57,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:57,704 INFO L85 PathProgramCache]: Analyzing trace with hash -929165957, now seen corresponding path program 1 times [2022-07-19 10:53:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:57,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359891018] [2022-07-19 10:53:57,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:57,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:53:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:57,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359891018] [2022-07-19 10:53:57,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359891018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:57,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:57,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:53:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791897403] [2022-07-19 10:53:57,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:57,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:53:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:53:57,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:53:57,782 INFO L87 Difference]: Start difference. First operand 565 states and 711 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:58,216 INFO L93 Difference]: Finished difference Result 722 states and 895 transitions. [2022-07-19 10:53:58,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:53:58,216 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2022-07-19 10:53:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:58,218 INFO L225 Difference]: With dead ends: 722 [2022-07-19 10:53:58,218 INFO L226 Difference]: Without dead ends: 604 [2022-07-19 10:53:58,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:53:58,218 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 217 mSDsluCounter, 2352 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 2709 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:58,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 2709 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:58,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-07-19 10:53:58,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 571. [2022-07-19 10:53:58,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 486 states have (on average 1.2469135802469136) internal successors, (606), 493 states have internal predecessors, (606), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-19 10:53:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 713 transitions. [2022-07-19 10:53:58,247 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 713 transitions. Word has length 56 [2022-07-19 10:53:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:58,248 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 713 transitions. [2022-07-19 10:53:58,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:53:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 713 transitions. [2022-07-19 10:53:58,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-19 10:53:58,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:58,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:58,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-19 10:53:58,249 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:58,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash -535968494, now seen corresponding path program 1 times [2022-07-19 10:53:58,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:58,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134625389] [2022-07-19 10:53:58,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:58,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:58,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:58,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 10:53:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:58,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:58,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134625389] [2022-07-19 10:53:58,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134625389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:58,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:58,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:53:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186893907] [2022-07-19 10:53:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:58,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:53:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:58,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:53:58,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:53:58,353 INFO L87 Difference]: Start difference. First operand 571 states and 713 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:53:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:58,979 INFO L93 Difference]: Finished difference Result 591 states and 734 transitions. [2022-07-19 10:53:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:53:58,979 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 62 [2022-07-19 10:53:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:58,980 INFO L225 Difference]: With dead ends: 591 [2022-07-19 10:53:58,980 INFO L226 Difference]: Without dead ends: 569 [2022-07-19 10:53:58,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:53:58,981 INFO L413 NwaCegarLoop]: 364 mSDtfsCounter, 235 mSDsluCounter, 2696 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 3060 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:58,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 3060 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:53:58,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-07-19 10:53:59,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2022-07-19 10:53:59,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 484 states have (on average 1.2458677685950412) internal successors, (603), 491 states have internal predecessors, (603), 49 states have call successors, (49), 28 states have call predecessors, (49), 35 states have return successors, (58), 49 states have call predecessors, (58), 44 states have call successors, (58) [2022-07-19 10:53:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 710 transitions. [2022-07-19 10:53:59,026 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 710 transitions. Word has length 62 [2022-07-19 10:53:59,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:59,027 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 710 transitions. [2022-07-19 10:53:59,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:53:59,027 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 710 transitions. [2022-07-19 10:53:59,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 10:53:59,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:59,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:59,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-19 10:53:59,028 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -274878733, now seen corresponding path program 1 times [2022-07-19 10:53:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:59,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169551681] [2022-07-19 10:53:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:53:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:53:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-19 10:53:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:59,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169551681] [2022-07-19 10:53:59,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169551681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:59,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:59,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:59,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500566064] [2022-07-19 10:53:59,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:59,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:59,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:59,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:59,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:59,081 INFO L87 Difference]: Start difference. First operand 569 states and 710 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:53:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:59,409 INFO L93 Difference]: Finished difference Result 600 states and 742 transitions. [2022-07-19 10:53:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 63 [2022-07-19 10:53:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:59,411 INFO L225 Difference]: With dead ends: 600 [2022-07-19 10:53:59,411 INFO L226 Difference]: Without dead ends: 553 [2022-07-19 10:53:59,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:59,411 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 170 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:59,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 1671 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:53:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2022-07-19 10:53:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 553. [2022-07-19 10:53:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 471 states have (on average 1.2420382165605095) internal successors, (585), 478 states have internal predecessors, (585), 46 states have call successors, (46), 28 states have call predecessors, (46), 35 states have return successors, (54), 46 states have call predecessors, (54), 41 states have call successors, (54) [2022-07-19 10:53:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 685 transitions. [2022-07-19 10:53:59,474 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 685 transitions. Word has length 63 [2022-07-19 10:53:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:59,474 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 685 transitions. [2022-07-19 10:53:59,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:53:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 685 transitions. [2022-07-19 10:53:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:53:59,475 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:59,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:59,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-07-19 10:53:59,475 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:59,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:59,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1927582732, now seen corresponding path program 1 times [2022-07-19 10:53:59,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:59,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800531318] [2022-07-19 10:53:59,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:53:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-19 10:53:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:53:59,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:59,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800531318] [2022-07-19 10:53:59,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800531318] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:59,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:59,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:53:59,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643687086] [2022-07-19 10:53:59,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:59,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:53:59,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:59,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:53:59,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:53:59,519 INFO L87 Difference]: Start difference. First operand 553 states and 685 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:53:59,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:53:59,814 INFO L93 Difference]: Finished difference Result 584 states and 717 transitions. [2022-07-19 10:53:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:53:59,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-07-19 10:53:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:53:59,815 INFO L225 Difference]: With dead ends: 584 [2022-07-19 10:53:59,815 INFO L226 Difference]: Without dead ends: 540 [2022-07-19 10:53:59,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:53:59,816 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 264 mSDsluCounter, 908 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:53:59,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 1240 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:53:59,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-19 10:53:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2022-07-19 10:53:59,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 459 states have (on average 1.2374727668845316) internal successors, (568), 466 states have internal predecessors, (568), 45 states have call successors, (45), 28 states have call predecessors, (45), 35 states have return successors, (53), 45 states have call predecessors, (53), 40 states have call successors, (53) [2022-07-19 10:53:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 666 transitions. [2022-07-19 10:53:59,845 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 666 transitions. Word has length 58 [2022-07-19 10:53:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:53:59,846 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 666 transitions. [2022-07-19 10:53:59,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 10:53:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 666 transitions. [2022-07-19 10:53:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-19 10:53:59,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:53:59,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:53:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-19 10:53:59,847 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:53:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:53:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1948179698, now seen corresponding path program 1 times [2022-07-19 10:53:59,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:53:59,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805764067] [2022-07-19 10:53:59,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:53:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:53:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:53:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:53:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:53:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:53:59,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-07-19 10:53:59,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:53:59,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805764067] [2022-07-19 10:53:59,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805764067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:53:59,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:53:59,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-19 10:53:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089196323] [2022-07-19 10:53:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:53:59,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 10:53:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:53:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 10:53:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-19 10:53:59,973 INFO L87 Difference]: Start difference. First operand 540 states and 666 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:54:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:00,539 INFO L93 Difference]: Finished difference Result 556 states and 682 transitions. [2022-07-19 10:54:00,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:54:00,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2022-07-19 10:54:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:00,541 INFO L225 Difference]: With dead ends: 556 [2022-07-19 10:54:00,541 INFO L226 Difference]: Without dead ends: 535 [2022-07-19 10:54:00,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:54:00,542 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 207 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 2652 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:00,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 2652 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:54:00,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-07-19 10:54:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2022-07-19 10:54:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 456 states have (on average 1.236842105263158) internal successors, (564), 463 states have internal predecessors, (564), 43 states have call successors, (43), 28 states have call predecessors, (43), 35 states have return successors, (51), 43 states have call predecessors, (51), 38 states have call successors, (51) [2022-07-19 10:54:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 658 transitions. [2022-07-19 10:54:00,570 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 658 transitions. Word has length 64 [2022-07-19 10:54:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:00,570 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 658 transitions. [2022-07-19 10:54:00,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:54:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 658 transitions. [2022-07-19 10:54:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:54:00,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:00,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:00,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-07-19 10:54:00,572 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:00,573 INFO L85 PathProgramCache]: Analyzing trace with hash 233509778, now seen corresponding path program 1 times [2022-07-19 10:54:00,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:00,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210532270] [2022-07-19 10:54:00,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:00,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-19 10:54:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:00,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:00,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:00,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210532270] [2022-07-19 10:54:00,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210532270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:00,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:00,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-19 10:54:00,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822348919] [2022-07-19 10:54:00,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:00,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 10:54:00,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:00,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 10:54:00,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:54:00,707 INFO L87 Difference]: Start difference. First operand 535 states and 658 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:01,213 INFO L93 Difference]: Finished difference Result 537 states and 659 transitions. [2022-07-19 10:54:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 10:54:01,214 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-07-19 10:54:01,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:01,215 INFO L225 Difference]: With dead ends: 537 [2022-07-19 10:54:01,215 INFO L226 Difference]: Without dead ends: 493 [2022-07-19 10:54:01,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:01,215 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 115 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 2522 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:01,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 2522 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:54:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-07-19 10:54:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 493. [2022-07-19 10:54:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 419 states have (on average 1.2458233890214798) internal successors, (522), 425 states have internal predecessors, (522), 40 states have call successors, (40), 26 states have call predecessors, (40), 33 states have return successors, (49), 41 states have call predecessors, (49), 36 states have call successors, (49) [2022-07-19 10:54:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 611 transitions. [2022-07-19 10:54:01,243 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 611 transitions. Word has length 57 [2022-07-19 10:54:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:01,243 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 611 transitions. [2022-07-19 10:54:01,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 611 transitions. [2022-07-19 10:54:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:54:01,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:01,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:01,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-07-19 10:54:01,244 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:01,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:01,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1034079897, now seen corresponding path program 1 times [2022-07-19 10:54:01,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:01,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51024534] [2022-07-19 10:54:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:01,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:01,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:54:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:54:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:01,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:01,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51024534] [2022-07-19 10:54:01,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51024534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:01,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:01,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945206295] [2022-07-19 10:54:01,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:01,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:01,370 INFO L87 Difference]: Start difference. First operand 493 states and 611 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:54:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:02,420 INFO L93 Difference]: Finished difference Result 1028 states and 1263 transitions. [2022-07-19 10:54:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-19 10:54:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-07-19 10:54:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:02,423 INFO L225 Difference]: With dead ends: 1028 [2022-07-19 10:54:02,423 INFO L226 Difference]: Without dead ends: 908 [2022-07-19 10:54:02,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=273, Invalid=1287, Unknown=0, NotChecked=0, Total=1560 [2022-07-19 10:54:02,424 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 686 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2237 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:02,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2237 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:54:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2022-07-19 10:54:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 717. [2022-07-19 10:54:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 604 states have (on average 1.2450331125827814) internal successors, (752), 616 states have internal predecessors, (752), 59 states have call successors, (59), 42 states have call predecessors, (59), 53 states have return successors, (75), 58 states have call predecessors, (75), 55 states have call successors, (75) [2022-07-19 10:54:02,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 886 transitions. [2022-07-19 10:54:02,492 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 886 transitions. Word has length 58 [2022-07-19 10:54:02,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:02,493 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 886 transitions. [2022-07-19 10:54:02,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:54:02,493 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 886 transitions. [2022-07-19 10:54:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:54:02,494 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:02,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:02,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-07-19 10:54:02,494 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -158060891, now seen corresponding path program 1 times [2022-07-19 10:54:02,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:02,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802335720] [2022-07-19 10:54:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:02,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:54:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:54:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802335720] [2022-07-19 10:54:02,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802335720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:02,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:02,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:54:02,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993960794] [2022-07-19 10:54:02,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:02,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:54:02,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:02,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:54:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:02,532 INFO L87 Difference]: Start difference. First operand 717 states and 886 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:54:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:03,006 INFO L93 Difference]: Finished difference Result 1014 states and 1243 transitions. [2022-07-19 10:54:03,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:54:03,007 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 58 [2022-07-19 10:54:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:03,009 INFO L225 Difference]: With dead ends: 1014 [2022-07-19 10:54:03,009 INFO L226 Difference]: Without dead ends: 905 [2022-07-19 10:54:03,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:54:03,009 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 789 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:03,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1876 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:54:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-07-19 10:54:03,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 537. [2022-07-19 10:54:03,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 458 states have (on average 1.2314410480349345) internal successors, (564), 464 states have internal predecessors, (564), 42 states have call successors, (42), 30 states have call predecessors, (42), 36 states have return successors, (51), 42 states have call predecessors, (51), 38 states have call successors, (51) [2022-07-19 10:54:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 657 transitions. [2022-07-19 10:54:03,046 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 657 transitions. Word has length 58 [2022-07-19 10:54:03,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:03,046 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 657 transitions. [2022-07-19 10:54:03,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-19 10:54:03,047 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 657 transitions. [2022-07-19 10:54:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-19 10:54:03,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:03,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-07-19 10:54:03,048 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 273629316, now seen corresponding path program 1 times [2022-07-19 10:54:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:03,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99662997] [2022-07-19 10:54:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 10:54:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 10:54:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:54:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99662997] [2022-07-19 10:54:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99662997] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:03,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-19 10:54:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204054996] [2022-07-19 10:54:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:03,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-19 10:54:03,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-19 10:54:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:54:03,145 INFO L87 Difference]: Start difference. First operand 537 states and 657 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:54:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:03,665 INFO L93 Difference]: Finished difference Result 554 states and 674 transitions. [2022-07-19 10:54:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:54:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-07-19 10:54:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:03,666 INFO L225 Difference]: With dead ends: 554 [2022-07-19 10:54:03,666 INFO L226 Difference]: Without dead ends: 504 [2022-07-19 10:54:03,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:54:03,667 INFO L413 NwaCegarLoop]: 296 mSDtfsCounter, 218 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 2377 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:03,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 2377 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:54:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-19 10:54:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2022-07-19 10:54:03,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 432 states have (on average 1.2222222222222223) internal successors, (528), 438 states have internal predecessors, (528), 37 states have call successors, (37), 28 states have call predecessors, (37), 34 states have return successors, (45), 37 states have call predecessors, (45), 33 states have call successors, (45) [2022-07-19 10:54:03,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 610 transitions. [2022-07-19 10:54:03,723 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 610 transitions. Word has length 60 [2022-07-19 10:54:03,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:03,723 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 610 transitions. [2022-07-19 10:54:03,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-19 10:54:03,724 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 610 transitions. [2022-07-19 10:54:03,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:54:03,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:03,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:03,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-07-19 10:54:03,725 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:03,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1406802114, now seen corresponding path program 1 times [2022-07-19 10:54:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:03,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441865068] [2022-07-19 10:54:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:03,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:54:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-19 10:54:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:03,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:03,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441865068] [2022-07-19 10:54:03,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441865068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:03,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:03,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:54:03,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948645872] [2022-07-19 10:54:03,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:03,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:54:03,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:03,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:54:03,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:03,775 INFO L87 Difference]: Start difference. First operand 504 states and 610 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:54:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:03,939 INFO L93 Difference]: Finished difference Result 531 states and 638 transitions. [2022-07-19 10:54:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:54:03,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 58 [2022-07-19 10:54:03,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:03,941 INFO L225 Difference]: With dead ends: 531 [2022-07-19 10:54:03,941 INFO L226 Difference]: Without dead ends: 494 [2022-07-19 10:54:03,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:03,942 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 67 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:03,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1135 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2022-07-19 10:54:03,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 494. [2022-07-19 10:54:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 423 states have (on average 1.2222222222222223) internal successors, (517), 429 states have internal predecessors, (517), 36 states have call successors, (36), 28 states have call predecessors, (36), 34 states have return successors, (43), 36 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-19 10:54:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 596 transitions. [2022-07-19 10:54:03,981 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 596 transitions. Word has length 58 [2022-07-19 10:54:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:03,981 INFO L495 AbstractCegarLoop]: Abstraction has 494 states and 596 transitions. [2022-07-19 10:54:03,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 10:54:03,981 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 596 transitions. [2022-07-19 10:54:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-19 10:54:03,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:03,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:03,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-07-19 10:54:03,982 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 472047151, now seen corresponding path program 1 times [2022-07-19 10:54:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:03,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226204718] [2022-07-19 10:54:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:54:03,994 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 10:54:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 10:54:04,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 10:54:04,033 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 10:54:04,034 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:54:04,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-07-19 10:54:04,038 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:04,040 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:54:04,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:54:04 BoogieIcfgContainer [2022-07-19 10:54:04,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:54:04,121 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:54:04,121 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:54:04,121 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:54:04,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:53:31" (3/4) ... [2022-07-19 10:54:04,123 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-19 10:54:04,186 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:54:04,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:54:04,187 INFO L158 Benchmark]: Toolchain (without parser) took 33867.64ms. Allocated memory was 94.4MB in the beginning and 587.2MB in the end (delta: 492.8MB). Free memory was 57.3MB in the beginning and 394.8MB in the end (delta: -337.6MB). Peak memory consumption was 154.0MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,187 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 66.0MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:54:04,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.45ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 51.9MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.63ms. Allocated memory is still 94.4MB. Free memory was 51.9MB in the beginning and 44.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,188 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 94.4MB. Free memory was 44.8MB in the beginning and 40.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,188 INFO L158 Benchmark]: RCFGBuilder took 941.00ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 59.8MB in the end (delta: -19.7MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,188 INFO L158 Benchmark]: TraceAbstraction took 32326.78ms. Allocated memory was 113.2MB in the beginning and 587.2MB in the end (delta: 474.0MB). Free memory was 59.2MB in the beginning and 404.3MB in the end (delta: -345.1MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,189 INFO L158 Benchmark]: Witness Printer took 65.82ms. Allocated memory is still 587.2MB. Free memory was 404.3MB in the beginning and 394.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:54:04,191 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 66.0MB in the end (delta: 28.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.45ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 51.9MB in the end (delta: 5.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.63ms. Allocated memory is still 94.4MB. Free memory was 51.9MB in the beginning and 44.8MB in the end (delta: 7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 94.4MB. Free memory was 44.8MB in the beginning and 40.1MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 941.00ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 40.1MB in the beginning and 59.8MB in the end (delta: -19.7MB). Peak memory consumption was 26.7MB. Max. memory is 16.1GB. * TraceAbstraction took 32326.78ms. Allocated memory was 113.2MB in the beginning and 587.2MB in the end (delta: 474.0MB). Free memory was 59.2MB in the beginning and 404.3MB in the end (delta: -345.1MB). Peak memory consumption was 129.9MB. Max. memory is 16.1GB. * Witness Printer took 65.82ms. Allocated memory is still 587.2MB. Free memory was 404.3MB in the beginning and 394.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 59]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int s ; [L33] int UNLOADED ; [L34] int NP ; [L35] int DC ; [L36] int SKIP1 ; [L37] int SKIP2 ; [L38] int MPR1 ; [L39] int MPR3 ; [L40] int IPC ; [L41] int pended ; [L42] int compFptr ; [L43] int compRegistered ; [L44] int lowerDriverReturn ; [L45] int setEventCalled ; [L46] int customIrp ; [L47] int routine ; [L48] int myStatus ; [L49] int pirp ; [L50] int Executive ; [L51] int Suspended ; [L52] int KernelMode ; [L53] int DeviceUsageTypePaging ; VAL [compFptr=0, compRegistered=0, customIrp=0, DC=0, DeviceUsageTypePaging=0, Executive=0, IPC=0, KernelMode=0, lowerDriverReturn=0, MPR1=0, MPR3=0, myStatus=0, NP=0, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=0, SKIP2=0, Suspended=0, UNLOADED=0] [L1718] int pirp__IoStatus__Status ; [L1719] int d = __VERIFIER_nondet_int() ; [L1720] int status = __VERIFIER_nondet_int() ; [L1721] int irp = __VERIFIER_nondet_int() ; [L1722] int we_should_unload = __VERIFIER_nondet_int() ; [L1723] int irp_choice = __VERIFIER_nondet_int() ; [L1724] int devobj = __VERIFIER_nondet_int() ; [L1725] int __cil_tmp9 ; [L1730] s = 0 [L1731] UNLOADED = 0 [L1732] NP = 0 [L1733] DC = 0 [L1734] SKIP1 = 0 [L1735] SKIP2 = 0 [L1736] MPR1 = 0 [L1737] MPR3 = 0 [L1738] IPC = 0 [L1739] pended = 0 [L1740] compFptr = 0 [L1741] compRegistered = 0 [L1742] lowerDriverReturn = 0 [L1743] setEventCalled = 0 [L1744] customIrp = 0 [L1745] routine = 0 [L1746] myStatus = 0 [L1747] pirp = 0 [L1748] Executive = 0 [L1749] Suspended = 5 [L1750] KernelMode = 0 [L1751] DeviceUsageTypePaging = 1 [L1754] pirp = irp [L1755] CALL _BLAST_init() [L67] UNLOADED = 0 [L68] NP = 1 [L69] DC = 2 [L70] SKIP1 = 3 [L71] SKIP2 = 4 [L72] MPR1 = 5 [L73] MPR3 = 6 [L74] IPC = 7 [L75] s = UNLOADED [L76] pended = 0 [L77] compFptr = 0 [L78] compRegistered = 0 [L79] lowerDriverReturn = 0 [L80] setEventCalled = 0 [L81] customIrp = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, routine=0, s=0, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1755] RET _BLAST_init() [L1757] COND TRUE status >= 0 [L1758] s = NP [L1759] customIrp = 0 [L1760] setEventCalled = customIrp [L1761] lowerDriverReturn = setEventCalled [L1762] compRegistered = lowerDriverReturn [L1763] compFptr = compRegistered [L1764] pended = compFptr [L1765] pirp__IoStatus__Status = 0 [L1766] myStatus = 0 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=0, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1767] COND TRUE irp_choice == 0 [L1768] pirp__IoStatus__Status = -1073741637 [L1769] myStatus = -1073741637 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0, we_should_unload=0] [L1772] CALL stub_driver_init() [L1707] s = NP [L1708] customIrp = 0 [L1709] setEventCalled = customIrp [L1710] lowerDriverReturn = setEventCalled [L1711] compRegistered = lowerDriverReturn [L1712] compFptr = compRegistered [L1713] pended = compFptr VAL [compFptr=0, compRegistered=0, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1772] RET stub_driver_init() [L1775] COND FALSE !(status < 0) [L1779] int tmp_ndt_1; [L1780] tmp_ndt_1 = __VERIFIER_nondet_int() [L1781] COND TRUE tmp_ndt_1 == 2 VAL [compFptr=0, compRegistered=0, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1798] CALL, EXPR CdAudioDeviceControl(devobj, pirp) [L313] int deviceExtension__Active = __VERIFIER_nondet_int() ; [L314] int status ; VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L317] COND FALSE !(deviceExtension__Active == 2) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L320] COND FALSE !(deviceExtension__Active == 3) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L323] COND FALSE !(deviceExtension__Active == 1) VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L326] COND TRUE deviceExtension__Active == 7 VAL [\old(DeviceObject)=0, \old(Irp)=0, compFptr=0, compRegistered=0, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L348] CALL, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L1591] int currentIrpStack__Parameters__DeviceIoControl__IoControlCode = __VERIFIER_nondet_int() ; [L1592] int deviceExtension__TargetDeviceObject = __VERIFIER_nondet_int() ; [L1593] int irpSp__Control ; [L1594] int tmp ; [L1595] int tmp___0 ; [L1596] int __cil_tmp8 ; [L1597] int __cil_tmp9 ; [L1598] int __cil_tmp10 ; [L1599] int __cil_tmp11 ; [L1600] int __cil_tmp12 ; [L1604] __cil_tmp8 = 56 [L1605] __cil_tmp9 = 16384 [L1606] __cil_tmp10 = 131072 [L1607] __cil_tmp11 = 147456 [L1608] __cil_tmp12 = 147512 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1609] COND TRUE currentIrpStack__Parameters__DeviceIoControl__IoControlCode == __cil_tmp12 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1610] COND FALSE !(s != NP) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=0, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1615] COND FALSE !(compRegistered != 0) [L1620] compRegistered = 1 [L1621] routine = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1625] irpSp__Control = 224 VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] CALL, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1900] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1901] int returnVal2 ; [L1902] int compRetStatus ; [L1903] int lcontext = __VERIFIER_nondet_int() ; [L1904] unsigned long __cil_tmp8 ; VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1907] COND TRUE \read(compRegistered) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1908] COND TRUE routine == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] CALL, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1569] int Irp__PendingReturned = __VERIFIER_nondet_int() ; [L1570] int Irp__AssociatedIrp__SystemBuffer = __VERIFIER_nondet_int() ; [L1573] COND TRUE \read(Irp__PendingReturned) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=0, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1574] COND TRUE pended == 0 [L1575] pended = 1 VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1582] COND FALSE !(myStatus >= 0) VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1587] return (myStatus); VAL [\old(Context)=-1, \old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=-1073741637, compFptr=0, compRegistered=1, Context=-1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__AssociatedIrp__SystemBuffer=0, Irp__PendingReturned=1, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] RET, EXPR HPCdrCompletion(DeviceObject, Irp, lcontext) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, HPCdrCompletion(DeviceObject, Irp, lcontext)=-1073741637, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1910] compRetStatus = HPCdrCompletion(DeviceObject, Irp, lcontext) [L1920] __cil_tmp8 = (unsigned long )compRetStatus VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1921] COND FALSE !(__cil_tmp8 == -1073741802) VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1928] COND FALSE !(\read(Irp__PendingReturned)) [L1931] int tmp_ndt_4; [L1932] tmp_ndt_4 = __VERIFIER_nondet_int() [L1933] COND TRUE tmp_ndt_4 == 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1944] returnVal2 = 0 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=1, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1958] COND TRUE s == NP [L1959] s = IPC [L1960] lowerDriverReturn = returnVal2 VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1981] return (returnVal2); VAL [\old(DeviceObject)=0, \old(Irp)=0, \old(lowerDriverReturn)=0, \old(pended)=0, \old(s)=1, \old(setEventCalled)=0, \result=0, __cil_tmp8=3221225659, compFptr=0, compRegistered=1, compRetStatus=-1073741637, customIrp=0, DC=2, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, Irp__PendingReturned=0, KernelMode=0, lcontext=-1, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, returnVal2=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp_ndt_4=0, UNLOADED=0] [L1626] RET, EXPR IofCallDriver(deviceExtension__TargetDeviceObject, Irp) VAL [\old(DeviceObject)=0, \old(Irp)=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IofCallDriver(deviceExtension__TargetDeviceObject, Irp)=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L1626] tmp = IofCallDriver(deviceExtension__TargetDeviceObject, Irp) [L1628] return (tmp); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, __cil_tmp10=131072, __cil_tmp11=147456, __cil_tmp12=147512, __cil_tmp8=56, __cil_tmp9=16384, compFptr=0, compRegistered=1, currentIrpStack__Parameters__DeviceIoControl__IoControlCode=147512, customIrp=0, DC=2, deviceExtension__TargetDeviceObject=0, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, irpSp__Control=224, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, tmp=0, UNLOADED=0] [L348] RET, EXPR CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L348] status = CdAudioHPCdrDeviceControl(DeviceObject, Irp) [L363] return (status); VAL [\old(DeviceObject)=0, \old(Irp)=0, \result=0, compFptr=0, compRegistered=1, customIrp=0, DC=2, deviceExtension__Active=7, DeviceObject=0, DeviceUsageTypePaging=1, Executive=0, IPC=7, Irp=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, UNLOADED=0] [L1798] RET, EXPR CdAudioDeviceControl(devobj, pirp) [L1798] status = CdAudioDeviceControl(devobj, pirp) [L1819] COND FALSE !(\read(we_should_unload)) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1825] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1826] COND FALSE !(s == NP) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1833] COND TRUE pended == 1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1834] COND FALSE !(s == MPR3) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1841] COND TRUE s != UNLOADED VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1842] COND TRUE status != -1 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1843] COND TRUE s != SKIP2 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1844] COND FALSE !(s != IPC) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1857] COND FALSE !(pended != 1) VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1869] COND TRUE status != 259 VAL [compFptr=0, compRegistered=1, customIrp=0, d=0, DC=2, DeviceUsageTypePaging=1, devobj=0, Executive=0, IPC=7, irp=0, irp_choice=0, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, pirp__IoStatus__Status=-1073741637, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, status=0, Suspended=5, tmp_ndt_1=2, UNLOADED=0, we_should_unload=0] [L1871] CALL errorFn() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] [L59] reach_error() VAL [compFptr=0, compRegistered=1, customIrp=0, DC=2, DeviceUsageTypePaging=1, Executive=0, IPC=7, KernelMode=0, lowerDriverReturn=0, MPR1=5, MPR3=6, myStatus=-1073741637, NP=1, pended=1, pirp=0, routine=0, s=7, setEventCalled=0, SKIP1=3, SKIP2=4, Suspended=5, UNLOADED=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 470 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.2s, OverallIterations: 68, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21677 SdHoareTripleChecker+Valid, 19.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21349 mSDsluCounter, 160335 SdHoareTripleChecker+Invalid, 16.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125190 mSDsCounter, 5717 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41908 IncrementalHoareTripleChecker+Invalid, 47625 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5717 mSolverCounterUnsat, 35145 mSDtfsCounter, 41908 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1098 GetRequests, 424 SyntacticMatches, 10 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=821occurred in iteration=4, InterpolantAutomatonStates: 598, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 67 MinimizatonAttempts, 2265 StatesRemovedByMinimization, 46 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3221 NumberOfCodeBlocks, 3221 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 3158 ConstructedInterpolants, 0 QuantifiedInterpolants, 8979 SizeOfPredicates, 4 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 69 InterpolantComputations, 67 PerfectInterpolantSequences, 12/15 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-19 10:54:04,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE