./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'e73e85347bbfce4f45897bd7cee996074c05d40818a217b9a91bb8d2644bc292'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 e73e85347bbfce4f45897bd7cee996074c05d40818a217b9a91bb8d2644bc292 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:26:48,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:26:48,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:26:48,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:26:48,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:26:48,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:26:49,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:26:49,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:26:49,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:26:49,005 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:26:49,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:26:49,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:26:49,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:26:49,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:26:49,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:26:49,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:26:49,005 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:26:49,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:26:49,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:26:49,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:26:49,006 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:26:49,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> e73e85347bbfce4f45897bd7cee996074c05d40818a217b9a91bb8d2644bc292 [2024-11-07 04:26:49,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:26:49,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:26:49,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:26:49,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:26:49,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:26:49,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i [2024-11-07 04:26:50,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:26:50,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:26:50,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i [2024-11-07 04:26:50,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb1be0608/ba87d67ec9dc4603ba1307c328249e0c/FLAG840140a31 [2024-11-07 04:26:50,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb1be0608/ba87d67ec9dc4603ba1307c328249e0c [2024-11-07 04:26:50,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:26:50,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:26:50,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:26:50,853 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:26:50,855 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:26:50,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:50" (1/1) ... [2024-11-07 04:26:50,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67fc5772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:50, skipping insertion in model container [2024-11-07 04:26:50,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:26:50" (1/1) ... [2024-11-07 04:26:50,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:26:50,987 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i[917,930] [2024-11-07 04:26:51,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:26:51,050 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:26:51,059 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-86.i[917,930] [2024-11-07 04:26:51,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:26:51,093 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:26:51,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51 WrapperNode [2024-11-07 04:26:51,095 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:26:51,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:26:51,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:26:51,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:26:51,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,147 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-07 04:26:51,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:26:51,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:26:51,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:26:51,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:26:51,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,156 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,173 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:26:51,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:26:51,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:26:51,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:26:51,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:26:51,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (1/1) ... [2024-11-07 04:26:51,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:26:51,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:26:51,217 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:26:51,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:26:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:26:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:26:51,237 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:26:51,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:26:51,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:26:51,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:26:51,290 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:26:51,293 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:26:51,605 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-07 04:26:51,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:26:51,619 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:26:51,621 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:26:51,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:51 BoogieIcfgContainer [2024-11-07 04:26:51,622 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:26:51,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:26:51,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:26:51,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:26:51,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:26:50" (1/3) ... [2024-11-07 04:26:51,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498bb567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:51, skipping insertion in model container [2024-11-07 04:26:51,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:26:51" (2/3) ... [2024-11-07 04:26:51,630 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498bb567 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:26:51, skipping insertion in model container [2024-11-07 04:26:51,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:26:51" (3/3) ... [2024-11-07 04:26:51,632 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-86.i [2024-11-07 04:26:51,662 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:26:51,662 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:26:51,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:26:51,730 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4ca14cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:26:51,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:26:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 04:26:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 04:26:51,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:26:51,747 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:26:51,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:26:51,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:26:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1687683337, now seen corresponding path program 1 times [2024-11-07 04:26:51,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:26:51,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451037146] [2024-11-07 04:26:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:26:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:26:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:26:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:26:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:26:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:26:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:26:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:26:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:26:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:26:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:26:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:26:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:26:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:26:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:26:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:26:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:26:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:26:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:26:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:26:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:26:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:26:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:26:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:26:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:26:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:26:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:26:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:26:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:26:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:26:52,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:26:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:26:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:26:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:26:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:26:52,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:26:52,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451037146] [2024-11-07 04:26:52,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451037146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:26:52,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:26:52,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:26:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187504558] [2024-11-07 04:26:52,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:26:52,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:26:52,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:26:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:26:52,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:26:52,086 INFO L87 Difference]: Start difference. First operand has 80 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 04:26:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:26:52,107 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2024-11-07 04:26:52,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:26:52,108 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 190 [2024-11-07 04:26:52,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:26:52,112 INFO L225 Difference]: With dead ends: 153 [2024-11-07 04:26:52,112 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 04:26:52,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:26:52,116 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:26:52,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:26:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 04:26:52,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 04:26:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 04:26:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 116 transitions. [2024-11-07 04:26:52,149 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 116 transitions. Word has length 190 [2024-11-07 04:26:52,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:26:52,151 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 116 transitions. [2024-11-07 04:26:52,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-07 04:26:52,152 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 116 transitions. [2024-11-07 04:26:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 04:26:52,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:26:52,156 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:26:52,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:26:52,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:26:52,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:26:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1176879243, now seen corresponding path program 1 times [2024-11-07 04:26:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:26:52,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401195841] [2024-11-07 04:26:52,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:26:52,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:26:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:27:08,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:27:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:27:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:27:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:27:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:27:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:27:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:27:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:27:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:27:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:27:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:27:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:27:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:27:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:27:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:27:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:27:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:27:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:27:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:27:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:27:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:27:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:27:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:27:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:27:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:27:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:27:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:27:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:27:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:27:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:27:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:27:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:27:08,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401195841] [2024-11-07 04:27:08,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401195841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:27:08,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:27:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 04:27:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181045130] [2024-11-07 04:27:08,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:27:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 04:27:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:27:08,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 04:27:08,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-07 04:27:08,086 INFO L87 Difference]: Start difference. First operand 76 states and 116 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:11,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:27:11,882 INFO L93 Difference]: Finished difference Result 207 states and 302 transitions. [2024-11-07 04:27:11,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 04:27:11,883 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 190 [2024-11-07 04:27:11,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:27:11,885 INFO L225 Difference]: With dead ends: 207 [2024-11-07 04:27:11,885 INFO L226 Difference]: Without dead ends: 134 [2024-11-07 04:27:11,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2024-11-07 04:27:11,887 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 95 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:27:11,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 770 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 04:27:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-07 04:27:11,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 91. [2024-11-07 04:27:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 04:27:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-11-07 04:27:11,897 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 190 [2024-11-07 04:27:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:27:11,898 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-11-07 04:27:11,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-11-07 04:27:11,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-07 04:27:11,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:27:11,900 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:27:11,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:27:11,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:27:11,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:27:11,901 INFO L85 PathProgramCache]: Analyzing trace with hash 2106970803, now seen corresponding path program 1 times [2024-11-07 04:27:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:27:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217888589] [2024-11-07 04:27:11,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:27:11,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:27:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:27:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:27:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:27:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:27:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:27:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:27:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:27:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:27:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:27:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:27:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:27:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:27:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:27:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:27:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:27:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:27:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:27:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:27:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:27:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:27:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:27:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:27:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:27:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:27:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:27:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:27:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:27:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:27:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:27:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:27:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:27:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:12,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:27:12,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:27:12,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217888589] [2024-11-07 04:27:12,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217888589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:27:12,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:27:12,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:27:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098066676] [2024-11-07 04:27:12,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:27:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:27:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:27:12,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:27:12,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:27:12,017 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:27:12,038 INFO L93 Difference]: Finished difference Result 210 states and 309 transitions. [2024-11-07 04:27:12,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:27:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 190 [2024-11-07 04:27:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:27:12,040 INFO L225 Difference]: With dead ends: 210 [2024-11-07 04:27:12,041 INFO L226 Difference]: Without dead ends: 122 [2024-11-07 04:27:12,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:27:12,042 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 47 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:27:12,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 268 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:27:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-07 04:27:12,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-07 04:27:12,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 78 states have internal predecessors, (96), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:27:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-07 04:27:12,052 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 190 [2024-11-07 04:27:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:27:12,053 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-07 04:27:12,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-07 04:27:12,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 04:27:12,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:27:12,055 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:27:12,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:27:12,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:27:12,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:27:12,055 INFO L85 PathProgramCache]: Analyzing trace with hash -547142856, now seen corresponding path program 1 times [2024-11-07 04:27:12,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:27:12,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63070065] [2024-11-07 04:27:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:27:12,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:27:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:27:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:27:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:27:23,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:27:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:27:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:27:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:27:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:27:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:27:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:27:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:27:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:27:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:27:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:27:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:27:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:27:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:27:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:27:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:27:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:27:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:27:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:27:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:27:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:27:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:27:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:27:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:27:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:27:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:27:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:27:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:27:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:27:23,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:27:23,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63070065] [2024-11-07 04:27:23,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63070065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:27:23,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:27:23,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:27:23,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371027712] [2024-11-07 04:27:23,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:27:23,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:27:23,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:27:23,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:27:23,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:27:23,961 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:27:28,286 INFO L93 Difference]: Finished difference Result 222 states and 302 transitions. [2024-11-07 04:27:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:27:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-11-07 04:27:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:27:28,289 INFO L225 Difference]: With dead ends: 222 [2024-11-07 04:27:28,289 INFO L226 Difference]: Without dead ends: 220 [2024-11-07 04:27:28,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2024-11-07 04:27:28,291 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 183 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 04:27:28,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 989 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 04:27:28,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-07 04:27:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 123. [2024-11-07 04:27:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.271604938271605) internal successors, (103), 82 states have internal predecessors, (103), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:27:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2024-11-07 04:27:28,301 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 191 [2024-11-07 04:27:28,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:27:28,302 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2024-11-07 04:27:28,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2024-11-07 04:27:28,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 04:27:28,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:27:28,304 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:27:28,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:27:28,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:27:28,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:27:28,304 INFO L85 PathProgramCache]: Analyzing trace with hash -288977418, now seen corresponding path program 1 times [2024-11-07 04:27:28,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:27:28,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217306797] [2024-11-07 04:27:28,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:27:28,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:27:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:27:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:27:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:27:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:27:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:27:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:27:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:27:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:27:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:27:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:27:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:27:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:27:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:27:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:27:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:27:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:27:35,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:27:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:27:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:27:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:27:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:27:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:27:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:27:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:27:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:27:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:27:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:27:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:27:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:27:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:27:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:27:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:35,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:27:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:27:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217306797] [2024-11-07 04:27:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217306797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:27:35,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:27:35,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:27:35,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17364814] [2024-11-07 04:27:35,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:27:35,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:27:35,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:27:35,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:27:35,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:27:35,027 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:27:37,552 INFO L93 Difference]: Finished difference Result 306 states and 433 transitions. [2024-11-07 04:27:37,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:27:37,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-11-07 04:27:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:27:37,560 INFO L225 Difference]: With dead ends: 306 [2024-11-07 04:27:37,560 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 04:27:37,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2024-11-07 04:27:37,561 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 191 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:27:37,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 678 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 04:27:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 04:27:37,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 133. [2024-11-07 04:27:37,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 91 states have (on average 1.2857142857142858) internal successors, (117), 92 states have internal predecessors, (117), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:27:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2024-11-07 04:27:37,578 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 191 [2024-11-07 04:27:37,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:27:37,578 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2024-11-07 04:27:37,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2024-11-07 04:27:37,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 04:27:37,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:27:37,580 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:27:37,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:27:37,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:27:37,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:27:37,581 INFO L85 PathProgramCache]: Analyzing trace with hash -464936843, now seen corresponding path program 1 times [2024-11-07 04:27:37,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:27:37,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653411032] [2024-11-07 04:27:37,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:27:37,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:27:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:27:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:27:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:27:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:27:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:27:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:27:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:27:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:27:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:27:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:27:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:27:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:27:46,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:27:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:27:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:27:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:27:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:27:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:27:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:27:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:27:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:27:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:27:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:27:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:27:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:27:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:27:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:27:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:27:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:27:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:27:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:27:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:27:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:27:46,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:27:46,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653411032] [2024-11-07 04:27:46,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653411032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:27:46,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:27:46,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:27:46,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564817610] [2024-11-07 04:27:46,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:27:46,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:27:46,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:27:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:27:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:27:46,946 INFO L87 Difference]: Start difference. First operand 133 states and 195 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:27:52,900 INFO L93 Difference]: Finished difference Result 196 states and 264 transitions. [2024-11-07 04:27:52,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 04:27:52,901 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-11-07 04:27:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:27:52,902 INFO L225 Difference]: With dead ends: 196 [2024-11-07 04:27:52,902 INFO L226 Difference]: Without dead ends: 194 [2024-11-07 04:27:52,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=230, Invalid=700, Unknown=0, NotChecked=0, Total=930 [2024-11-07 04:27:52,903 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 194 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:27:52,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 853 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 04:27:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-07 04:27:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 140. [2024-11-07 04:27:52,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:27:52,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 205 transitions. [2024-11-07 04:27:52,914 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 205 transitions. Word has length 191 [2024-11-07 04:27:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:27:52,914 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 205 transitions. [2024-11-07 04:27:52,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:27:52,915 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 205 transitions. [2024-11-07 04:27:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 04:27:52,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:27:52,916 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:27:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:27:52,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:27:52,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:27:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -407678541, now seen corresponding path program 1 times [2024-11-07 04:27:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:27:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885982390] [2024-11-07 04:27:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:27:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:27:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:28:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:28:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:28:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:28:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:28:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:28:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:28:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:28:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 04:28:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:28:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 04:28:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:28:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 04:28:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:28:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:28:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:28:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:28:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:28:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:28:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:28:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:28:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:28:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 04:28:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:28:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 04:28:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:28:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-07 04:28:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:28:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 04:28:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 04:28:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 04:28:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:28:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-07 04:28:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:28:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885982390] [2024-11-07 04:28:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885982390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:28:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:28:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:28:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551459666] [2024-11-07 04:28:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:28:03,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:28:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:28:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:28:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:28:03,626 INFO L87 Difference]: Start difference. First operand 140 states and 205 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:28:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:28:08,975 INFO L93 Difference]: Finished difference Result 181 states and 248 transitions. [2024-11-07 04:28:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:28:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2024-11-07 04:28:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:28:08,978 INFO L225 Difference]: With dead ends: 181 [2024-11-07 04:28:08,978 INFO L226 Difference]: Without dead ends: 179 [2024-11-07 04:28:08,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2024-11-07 04:28:08,981 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 167 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:28:08,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 706 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 04:28:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-07 04:28:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2024-11-07 04:28:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-07 04:28:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 205 transitions. [2024-11-07 04:28:09,004 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 205 transitions. Word has length 191 [2024-11-07 04:28:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:28:09,004 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 205 transitions. [2024-11-07 04:28:09,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-07 04:28:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 205 transitions. [2024-11-07 04:28:09,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-07 04:28:09,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:28:09,011 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:28:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:28:09,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:28:09,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:28:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1548117915, now seen corresponding path program 1 times [2024-11-07 04:28:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:28:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925060188] [2024-11-07 04:28:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:28:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:28:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat