./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 4623efc2673ee52abd070f0d21e51a11b98cc22b8397a5181b7ee0443b3e1285 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:47:33,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:47:33,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:47:33,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:47:33,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:47:33,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:47:33,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:47:33,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:47:33,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:47:33,438 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:47:33,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:47:33,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:47:33,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:47:33,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:47:33,440 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:47:33,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:47:33,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:47:33,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:47:33,442 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:47:33,442 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:47:33,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:47:33,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:47:33,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:47:33,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:47:33,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:47:33,446 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:47:33,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:47:33,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:47:33,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:47:33,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:47:33,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:47:33,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:47:33,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:47:33,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:47:33,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:47:33,453 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:47:33,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:47:33,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:47:33,456 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:47:33,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:47:33,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:47:33,457 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:47:33,457 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 4623efc2673ee52abd070f0d21e51a11b98cc22b8397a5181b7ee0443b3e1285 [2024-10-13 00:47:33,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:47:33,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:47:33,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:47:33,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:47:33,802 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:47:33,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-10-13 00:47:35,233 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:47:35,456 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:47:35,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-10-13 00:47:35,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d9c8651/5725af13adc84268bdfb7fcec806a109/FLAGd9574ecb4 [2024-10-13 00:47:35,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d9c8651/5725af13adc84268bdfb7fcec806a109 [2024-10-13 00:47:35,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:47:35,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:47:35,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:47:35,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:47:35,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:47:35,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:35,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a3ba30c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35, skipping insertion in model container [2024-10-13 00:47:35,490 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:35,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:47:35,698 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i[915,928] [2024-10-13 00:47:35,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:47:35,809 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:47:35,825 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i[915,928] [2024-10-13 00:47:35,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:47:35,883 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:47:35,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35 WrapperNode [2024-10-13 00:47:35,884 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:47:35,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:47:35,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:47:35,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:47:35,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:35,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:35,976 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-13 00:47:35,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:47:35,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:47:35,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:47:35,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:47:35,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:35,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:35,996 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,030 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-10-13 00:47:36,032 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,032 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,056 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,060 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:47:36,068 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:47:36,069 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:47:36,069 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:47:36,070 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (1/1) ... [2024-10-13 00:47:36,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:47:36,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:47:36,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:47:36,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:47:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:47:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:47:36,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:47:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:47:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:47:36,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:47:36,249 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:47:36,251 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:47:36,674 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 00:47:36,674 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:47:36,717 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:47:36,718 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:47:36,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:47:36 BoogieIcfgContainer [2024-10-13 00:47:36,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:47:36,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:47:36,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:47:36,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:47:36,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:47:35" (1/3) ... [2024-10-13 00:47:36,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf8e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:47:36, skipping insertion in model container [2024-10-13 00:47:36,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:47:35" (2/3) ... [2024-10-13 00:47:36,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf8e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:47:36, skipping insertion in model container [2024-10-13 00:47:36,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:47:36" (3/3) ... [2024-10-13 00:47:36,727 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-10-13 00:47:36,740 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:47:36,740 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:47:36,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:47:36,804 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;@59df805e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:47:36,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:47:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 00:47:36,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 00:47:36,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:36,823 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:47:36,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:36,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:36,828 INFO L85 PathProgramCache]: Analyzing trace with hash -990600732, now seen corresponding path program 1 times [2024-10-13 00:47:36,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482053414] [2024-10-13 00:47:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:47:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:47:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:47:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:47:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:47:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:47:37,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:47:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:47:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:47:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:47:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:47:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:47:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:47:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:47:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:47:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:47:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:47:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:47:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:47:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:47:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:47:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:47:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:47:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:47:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:47:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:47:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:47:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-13 00:47:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 00:47:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482053414] [2024-10-13 00:47:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482053414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:37,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:47:37,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876200413] [2024-10-13 00:47:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:37,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:47:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:47:37,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:47:37,454 INFO L87 Difference]: Start difference. First operand has 82 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 00:47:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:37,505 INFO L93 Difference]: Finished difference Result 161 states and 292 transitions. [2024-10-13 00:47:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:47:37,508 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 206 [2024-10-13 00:47:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:37,516 INFO L225 Difference]: With dead ends: 161 [2024-10-13 00:47:37,516 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 00:47:37,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-10-13 00:47:37,523 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:37,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:47:37,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 00:47:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-13 00:47:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 00:47:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2024-10-13 00:47:37,613 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 206 [2024-10-13 00:47:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:37,614 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2024-10-13 00:47:37,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 00:47:37,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2024-10-13 00:47:37,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 00:47:37,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:37,625 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:47:37,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:47:37,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:37,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash -621579484, now seen corresponding path program 1 times [2024-10-13 00:47:37,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:37,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675253694] [2024-10-13 00:47:37,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:37,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:47:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:47:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:47:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:47:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:47:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:47:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:47:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:47:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:47:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:47:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:47:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:47:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:47:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:47:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:47:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:47:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:47:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:47:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:47:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:47:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:47:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:47:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:47:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:47:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:47:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:47:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:47:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-13 00:47:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 00:47:38,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675253694] [2024-10-13 00:47:38,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675253694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:38,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:38,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:47:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279486414] [2024-10-13 00:47:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:38,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 00:47:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:38,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 00:47:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 00:47:38,131 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 00:47:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:38,208 INFO L93 Difference]: Finished difference Result 224 states and 349 transitions. [2024-10-13 00:47:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 00:47:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 206 [2024-10-13 00:47:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:38,212 INFO L225 Difference]: With dead ends: 224 [2024-10-13 00:47:38,212 INFO L226 Difference]: Without dead ends: 145 [2024-10-13 00:47:38,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 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-10-13 00:47:38,214 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 97 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:38,215 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:47:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-13 00:47:38,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-10-13 00:47:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 78 states have internal predecessors, (98), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 00:47:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 222 transitions. [2024-10-13 00:47:38,247 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 222 transitions. Word has length 206 [2024-10-13 00:47:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 222 transitions. [2024-10-13 00:47:38,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 00:47:38,248 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 222 transitions. [2024-10-13 00:47:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 00:47:38,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:38,251 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:47:38,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:47:38,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:38,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:38,253 INFO L85 PathProgramCache]: Analyzing trace with hash 389537766, now seen corresponding path program 1 times [2024-10-13 00:47:38,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:38,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233902802] [2024-10-13 00:47:38,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:38,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:47:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:47:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:47:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:47:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:47:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:47:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:47:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:47:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:47:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:47:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:47:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 00:47:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 00:47:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 00:47:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-13 00:47:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 00:47:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-13 00:47:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 00:47:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-13 00:47:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 00:47:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-13 00:47:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 00:47:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 00:47:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 00:47:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 00:47:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 00:47:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 00:47:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 00:47:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 00:47:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-13 00:47:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 00:47:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-13 00:47:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-13 00:47:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-13 00:47:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:47:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 00:47:39,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:47:39,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233902802] [2024-10-13 00:47:39,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233902802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:47:39,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:47:39,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:47:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023245470] [2024-10-13 00:47:39,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:47:39,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:47:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:47:39,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:47:39,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:47:39,284 INFO L87 Difference]: Start difference. First operand 142 states and 222 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 00:47:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:47:39,423 INFO L93 Difference]: Finished difference Result 355 states and 545 transitions. [2024-10-13 00:47:39,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:47:39,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 206 [2024-10-13 00:47:39,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:47:39,431 INFO L225 Difference]: With dead ends: 355 [2024-10-13 00:47:39,431 INFO L226 Difference]: Without dead ends: 214 [2024-10-13 00:47:39,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:47:39,435 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:47:39,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 377 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:47:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-13 00:47:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2024-10-13 00:47:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 120 states have internal predecessors, (154), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-13 00:47:39,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 294 transitions. [2024-10-13 00:47:39,465 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 294 transitions. Word has length 206 [2024-10-13 00:47:39,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:47:39,466 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 294 transitions. [2024-10-13 00:47:39,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 00:47:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 294 transitions. [2024-10-13 00:47:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-13 00:47:39,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:47:39,469 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 00:47:39,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:47:39,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:47:39,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:47:39,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2130422168, now seen corresponding path program 1 times [2024-10-13 00:47:39,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:47:39,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563345219] [2024-10-13 00:47:39,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:47:39,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:47:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat